An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter

Smid, Michiel

Local TagsRelease HistoryDetailsSummary

An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter

Smid, M.(1993). An O(n log n) algorithm for finding a k-point subset with minimal L∞-diameter (MPI-I-93-116). Saarbrücken: Max-Planck-Institut für Informatik.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-B3F8-4 Version Permalink: https://hdl.handle.net/21.11116/0000-000D-5ED2-D

Genre: Report

Latex : An $O(n\log n)$ algorithm for finding a $k$-point subset with minimal $L_{\infty}$-diameter

Files

show Files

hide Files

:

MPI-I-93-116.pdf (Publisher version), 12MB

View Save

File Permalink:
https://hdl.handle.net/21.11116/0000-000D-5ED3-C

Name:
MPI-I-93-116.pdf

Description:
-

OA-Status:
Not specified

Visibility:
Public

MIME-Type / Checksum:
application/pdf / [MD5]

Technical Metadata:

View

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Smid, Michiel¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 1993

Publication Status: Issued

Pages: 17 p.

Publishing info: Saarbrücken : Max-Planck-Institut für Informatik

Table of Contents: -

Rev. Type: -

Identifiers: Report Nr.: MPI-I-93-116
BibTex Citekey: Smid93

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Research Report / Max-Planck-Institut für Informatik

Source Genre: Series

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -