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

Smid, Michiel

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

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

MPS-Authors

/persons/resource/persons45509

Smid, Michiel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

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

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B3F8-4

Abstract

There is no abstract available