Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
From MaRDI portal
Publication:2867669
DOI10.1007/978-3-319-03841-4_29zbMath1406.68076arXiv1306.2079OpenAlexW8509995MaRDI QIDQ2867669
Publication date: 20 December 2013
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2079
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (3)
Edge routing with ordered bundles ⋮ Parameterized analysis and crossing minimization problems ⋮ Crossing Minimization in Storyline Visualization
This page was built for publication: Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
