Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem

@inproceedings{Argyriou2008TwoPT,
title={Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem},
author={Evmorfia N. Argyriou and Michael A. Bekos and Michael Kaufmann and Antonios Symvonis},
booktitle={Graph Drawing},
year={2008}
}

The metro-line crossing minimization (MLCM) problem was recently introduced in [5] as a response to the problem of drawing metro maps or public transportation networks, in general. According to this problem, we are given a planar, embedded graph G = (V, E) and a set L of simple paths on G, called lines. The main task is to place the lines on the embedding of G, so that the number of crossings among pairs of lines is minimized. Our main contribution is two polynomial time algorithms. The first… CONTINUE READING