An improved algorithm for the metro-line crossing minimization problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5849 LNCS, Issue , 2010, Pages 381-392

  Nöllenburg, Martin ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

A-PLANE; CROSSING MINIMIZATION; IMPROVED ALGORITHM; LAYOUT ALGORITHMS; LINE CROSSINGS; METRO MAPS; PLANE GRAPHS; RUNNING TIME; TIME ALGORITHMS; TRANSPORT LINE;

DRAWING (GRAPHICS); OPTIMIZATION; TRANSPORTATION ROUTES;

ALGORITHMS;

EID: 77951585940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11805-0_36     Document Type: Conference Paper

References (9)

1. Asquith,M., Gudmundsson, J., Merrick, D.: An ILP for the metro-line crossing problem. In: Harland, J., Manyem, P. (eds.) Proc. 14th Computing: The Australasian Theory Symp. (CATS 2008). CRPIT, vol. 77, pp. 49-56. Australian Comput. Soc. (2008)
2. Argyriou, E., Bekos, M.A., Kaufmann, M., Symvonis, A.: Two polynomial time algorithms for the metro-line crossing minimization problem. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 336-347. Springer, Heidelberg (2009)
3. Ovenden, M.: Metro Maps of the World. Capital Transport Publishing (2003)
4. Stott, J.M., Rodgers, P.: Metro map layout using multicriteria optimization. In: Proc. 8th Internat. Conf. Information Visualisation (IV 2004), pp. 355-362. IEEE, Los Alamitos (2004)
5. Hong, S.H., Merrick, D., do Nascimento, H.A.D.: Automatic visualization of metro maps. J. Visual Languages and Computing 17, 203-224 (2006)
6. 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)
7. Hahn, W.C., Weinberg, R.A.: A subway map of cancer pathways (2002); Poster in Nature Reviews Cancer
8. Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in wiring diagrams and public transportation maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 270-281. Springer, Heidelberg (2007)
9. 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)