MPI-INF/SWS Research Reports 1991-2021

2. Number - only D1


Weak epsilon-nets for points on a hypersphere

Bradford, Phillip G. and Capoyleas, Vasilis

October 1995, 8 pages.

Status: available - back from printing

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.

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Bradford, Phillip G. and Capoyleas, Vasilis},
  TITLE = {Weak epsilon-nets for points on a hypersphere},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-95-1-029},
  MONTH = {October},
  YEAR = {1995},
  ISSN = {0946-011X},