Weak epsilon-nets for points on a hypersphere

Bradford, Phillip G.; Capoyleas, Vasilis

アイテム詳細

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

一時保存へ追加

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

公開

報告書

Weak epsilon-nets for points on a hypersphere

MPS-Authors

Bradford, Phillip G.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Capoyleas, Vasilis
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-95-1-029.pdf
(全文テキスト（全般）), 5MB

付随資料 (公開)

There is no public supplementary material available

引用

Bradford, P. G., & Capoyleas, V.(1995). Weak epsilon-nets for points on a hypersphere (MPI-I-1995-1-029). Saarbrücken: Max-Planck-Institut für Informatik.

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

要旨

We present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NP-hard, and that for the general problem with two variable layers, true optima can be computed for sparse instances in which the smaller layer contains up to 15 nodes. For bigger instances, the iterated barycenter method turns out to be the method of choice among several popular heuristics whose performance we could assess by comparing the results to optimum solutions.