Travelling on graphs with small highway dimension

DOI10.1007/978-3-030-30786-8_14OpenAlexW2972966330MaRDI QIDQ5919468

Yann Disser, Jochen Könemann, Max Klimm, Andreas Emil Feldmann

Publication date: 24 February 2020

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.07040

zbMATH Keywords

NP-hardnessapproximation schemehighway dimensionSteiner TreeTravelling Salesperson

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Unnamed Item ⋮ Polynomial time approximation schemes for clustering in low highway dimension graphs ⋮ Travelling on graphs with small highway dimension ⋮ Computing Constrained Shortest-Paths at Scale

This page was built for publication: Travelling on graphs with small highway dimension