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

  • Evmorfia Argyriou
  • Michael A. Bekos
  • Michael Kaufmann
  • Antonios Symvonis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)


The metro-line crossing minimization (MLCM) problem was recently introduced 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 G, so that the number of crossings among pairs of lines is minimized.

Our main contribution is two polynomial time algorithms. The first solves the general case of the MLCM problem, where the lines that traverse a particular vertex of G are allowed to use any side of it to either “enter” or “exit”, assuming that the endpoints of the lines are located at vertices of degree one. The second one solves more efficiently the restricted case, where only the left and the right side of each vertex can be used.

To the best of our knowledge, this is the first time where the general case of the MLCM problem is solved. Previous work was devoted to the restricted case of the MLCM problem under the additional assumption that the endpoints of the lines are either the topmost or the bottommost in their corresponding vertices, i.e., they are either on top or below the lines that pass through the vertex. Even for this case, we improve a known result of Asquith et al. from O(|E|5/2|L|3) to O(|V|(|E| + |L|)).


Polynomial Time Algorithm Terminal Station Simple Path Incoming Edge Underlying Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Asquith, M., Gudmundsson, J., Merrick, D.: An ILP for the metro-line crossing problem. In: 14th Computing: The Australian Theory Symposium, pp. 49–56 (2008)Google Scholar
  2. 2.
    Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Line crossing minimization on metro maps. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 231–242. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in wiring diagrams and public transport maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 270–281. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  5. 5.
    Hong, S.H., Merrick, D., Nascimento, H.: The metro map layout problem. In: Churcher, N., Churcher, C. (eds.) 2004. CRPIT, vol. 35, pp. 91–100 (2004)Google Scholar
  6. 6.
    Merrick, D., Gudmundsson, J.: Path simplification for metro map layout. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 258–269. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Nöllenburg, M., Wolff, A.: A mixed-integer program for drawing high-quality metro maps. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 321–333. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Stott, J.M., Rodgers, P.: Metro Map Layout Using Multicriteria Optimization. In: 8th International Conference on Information Visualisation (IV 2004), pp. 355–362. IEEE, Los Alamitos (2004)Google Scholar
  9. 9.
    Wolff, A., Strijk, T.: The Map-Labeling Bibliography, maintained since (1996),

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Evmorfia Argyriou
    • 1
  • Michael A. Bekos
    • 1
  • Michael Kaufmann
    • 2
  • Antonios Symvonis
    • 1
  1. 1.School of Applied Mathematical & Physical SciencesNational Technical University of AthensGreece
  2. 2.Institute for InformaticsUniversity of TübingenGermany

Personalised recommendations