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

Smid, Michiel

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

報告書

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

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

MPI-I-93-116.pdf
(出版社版), 12MB

付随資料 (公開)

There is no public supplementary material available

引用

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.

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

要旨

要旨はありません