2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
Jünger, Michael and Mutzel, Petra
2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.
Published in: Journal of Graph Algorithms and Applications Vol. 1. pp. 1-25.
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.
- Preprinted Version
|Editorial actions:||View Item (Login required)|
|Citations:||No citation data.|
|Uncontrolled Keywords:||automatic graph drawing branch-and-cut crossing minimization linear ordering polyhedral combinatorics|
|Divisions:||Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger|
|Depositing User:||Prof. Dr. Michael Jünger|
|Date Deposited:||08 May 2003 00:00|
|Last Modified:||07 Oct 2011 12:35|