An ILP for the metro-line crossing problem

Conferences in Research and Practice in Information Technology Series

Volumn 77, Issue , 2008, Pages

  Asquith, Matthew ^a,b   Gudmundsson, Joachim ^c   Merrick, Damian ^b,c  

^a Sophos Pty Ltd   (Australia)

^b UNIVERSITY OF SYDNEY   (Australia)

^c CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDED GRAPHS; INTEGER LINEAR PROGRAMS; NP-HARD; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; PUBLIC TRANSPORTATION NETWORKS; RAILROAD NETWORKS; RELATIVE ORDER;

GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION;

COMPUTATION THEORY;

EID: 84863561108     PISSN: 14451336     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. M. Asquith (2007), The Metro map line ordering problem, Honours thesis, School of IT, University of Sydney, 2007.
2. M. Bekos, M. Kaufmann, K. Potika & A. Symvo-nis (2007), Line Crossing Minimization on Metro Maps, in 'Proceedings of the 15th International Symposium on Graph Drawing', 2007.
3. M. Benkert, M. NÄollenburg, T. Uno & A. Wolff (2006), Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps, in 'Proceedings of the 14th International Symposium on Graph Drawing', 2006.
4. C. Buchheim, D. Ebner, M. JÄunger, G. Klau, P. Mutzel and R. Weiskircher (2005), Exact Cross-ing Minimization, in 'Proceedings of the 13th In-ternational Symposium on Graph Drawing', 2005.
5. P. Eades, B. McKay & N. Wormald (1986), On an edge crossing problem, in 'Proceedings of the 9th Australian Computer Science Conference', 1986.
6. M. Formann & F. Wagner(1991), A Packing Problem with Applications to Lettering of Maps, in 'Pro-ceedings of the 7th Annual ACM Symposium on Computational Geometry', 1991.
7. K. Garland (1993), Mr Beck's Underground Map, Capital Transport Publishing, 1994.
8. G. Groenveld (1989), On global wire ordering for macro-cell routing, in 'Proceedings of the 26th ACM/IEEE Conference on Design Automation', 1989.
9. S.-H. Hong, D. Merrick & H. A. D. do Nascimento (2006), Automatic visualisation of metro maps. Journal of Visual Languages & Computing, 17(3): 203-224, 2006.
10. M. Marek-Sadowska & M. Sarrafzadeh(1995), The Crossing Distribution Problem, IEEE Transactions on Computer-Aided Design, 14:423{433, 1995.
11. D. Merrick & J. Gudmundsson (2006), Increasing the Readability of Graph Drawings with Centrality-Based Scaling, in 'Proceedings of the Asia-Paci-c Symposium on Information Visualisation', 2006.
12. D. Merrick & J. Gudmundsson (2006), C-Directed Path Simpli-cation for Metro Map Layout, in 'Pro-ceedings of the 14th International Symposium on Graph Drawing', 2006.
13. M. NÄollenburg (2005), Automated Drawing of Metro Maps, Master Thesis, FakultÄat fÄur Informatik, Uni-versitÄat Karlsruhe, Germany, 2005.
14. M. NÄollenburg & A. Wolff (2005), A Mixed-Integer Program for Drawing High-Quality Metro Maps, in 'Proceedings of the 13th International Symposium on Graph Drawing', 2005.
15. H. Purchase, R. Cohen & M. James (1996), Validating Graph Drawing Aesthetics, in 'Proceedings of the 3rd International Symposium on Graph Drawing', 1996.
16. E. Sandvad, K. Gr¿nb1/2k, L. Sloth & J. Lindskov Knudsen (2001), A metro map metaphor for guided tours on the Web: the Webvise guided tour sys-tem, in 'Proceedings of the 10th International ACM Conference on World Wide Web', 2001.
17. J. Stott & P. Rodgers (2004), Metro map layout using multicriteria optimization, in 'Proceedings of the 8th International Conference on Information Visu-alisation', 2004.
18. A. Wolff & T. Strijk (2007), The Map-Labeling Bibliography, Accessed on 24 May 2007, http://i11www.ira.uka.de/map-labeling/bibliography/.