Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization

Jünger, Michael and Mutzel, Petra (1996) Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 337-348(Official URL: http://dx.doi.org/10.1007/BFb0021817).

This is the latest version of this item.

Full text not available from this repository.

Abstract

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 solution.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021817
Classifications: G Algorithms and Complexity > G.700 Layering
G Algorithms and Complexity > G.420 Crossings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/162

Available Versions of this Item

Actions (login required)

View Item View Item