2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms

Michael Jünger, Petra Mutzel
1997 Journal of Graph Algorithms and Applications  
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
more » ... od turns out to be the method of choice among several popular heuristics whose performance we could assess by comparing their results to optimum solutions.
doi:10.7155/jgaa.00001 fatcat:quhd2aacavdkhctkoo72si2rxi