Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases

Fink, Martin and Pupyrev, Sergey (2013) Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases. In: 21st International Symposium, GD 2013, September 23-25, 2013 , pp. 328-339(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_29).

Full text not available from this repository.

Abstract

Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization problem (MLCM): Given an embedded graph and a set L of simple paths, called lines, order the lines on each edge so that the total number of crossings is minimized. So far, the complexity of MLCM has been an open problem. In contrast, the problem variant in which line ends must be placed in outermost position on their edges (MLCM-P) is known to be NP-hard. Our main results answer two open questions: (i) We show that MLCM is NP-hard. (ii) We give an O(log|L|−−−−−−√) -approximation algorithm for MLCM-P.

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.420 Crossings
P Styles > P.999 Others
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 13 Aug 2014 15:49
Last Modified: 13 Aug 2014 15:49
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1386

Actions (login required)

View Item View Item