@article{fink+etal2015blockcrossingsjgaa,
  abstract = {A problem that arises in drawings of transportation networks is to minimize the number of crossings between different transportation lines. While this can be done efficiently under specific constraints, not all solutions are visually equivalent. We suggest merging single crossings into \emph{block crossings}, that is, crossings of two neighboring groups of consecutive lines.

Unfortunately, minimizing the total number of block crossings is \mbox{NP-hard} even for very simple graphs. We give approximation algorithms for special classes of graphs and an asymptotically worst-case optimal algorithm for block crossings on general graphs. Furthermore, we show that the problem remains NP-hard on planar graphs even if both the maximum degree and the number of lines per edge are bounded by constants; on trees, this restricted version becomes tractable.},
  added-at = {2015-03-04T01:08:22.000+0100},
  author = {Fink, Martin and Pupyrev, Sergey and Wolff, Alexander},
  biburl = {https://www.bibsonomy.org/bibtex/237da557b78079f383884b756edc9afaa/fink},
  doi = {10.7155/jgaa.00351},
  interhash = {cb9eadd8cbb3bb0a5328e694ea8115d2},
  intrahash = {37da557b78079f383884b756edc9afaa},
  journal = {Journal of Graph Algorithms and Applications},
  keywords = {block crossings lines metro myown ordering},
  number = 1,
  pages = {111--153},
  timestamp = {2015-03-04T01:08:22.000+0100},
  title = {Ordering Metro Lines by Block Crossings},
  url = {http://dx.doi.org/10.7155/jgaa.00351},
  volume = 19,
  year = 2015
}