Exact and Fixed-Parameter Algorithms for Metro-Line Crossing Minimization Problems

Okamoto, Yoshio and Tatsu, Yuichi and Uno, Yushi (2013) Exact and Fixed-Parameter Algorithms for Metro-Line Crossing Minimization Problems. In: 21st International Symposium, GD 2013, September 23-25, 2013, Bordeaux, France , pp. 520-521 .

Full text not available from this repository.


Item Type:Conference Poster
Classifications:G Algorithms and Complexity > G.420 Crossings
ID Code:1405

Repository Staff Only: item control page

References

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)

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)

Benkert, M., Nöllenburg, M., Uno, T., Wolff, A.: Minimizing intra-edge crossings in writing diagrams and public transportation maps. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 270-281. Springer, Heidelberg (2007)

Fink, M.: Pupyrev, S.: Metro-line crossimg minimization: hardness, approximations, and tractable cases. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 328-339. Springer Heidelberg (2013)

Nöllenburg, M.: An improved algorithm for the metro-line crossing minimization problem. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 381-392. Springer, Heidelberg (2010)

Okamoto, Y., Tatsu, Y., Uno, Y.: Exact and fixed-parameter algorithms for metro-line crossing minimization problems. arXiv:1306.3538(cs.DS) (2013)