The complexity of routing with few collisions
From MaRDI portal
Publication:1679978
DOI10.1007/978-3-662-55751-8_21zbMath1495.68168arXiv1705.03673OpenAlexW2613615268MaRDI QIDQ1679978
Manuel Sorge, Till Fluschnik, Marco Morik
Publication date: 22 November 2017
Full work available at URL: https://arxiv.org/abs/1705.03673
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: The complexity of routing with few collisions