The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
From MaRDI portal
Publication:5449750
DOI10.1007/11589440_2zbMath1136.52304OpenAlexW1527145816MaRDI QIDQ5449750
Alexander Wolff, Florian Widmann, Marc Benkert
Publication date: 18 March 2008
Published in: Discrete and Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000003164
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (3)
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem ⋮ A rounding algorithm for approximating minimum Manhattan networks ⋮ Minimum Manhattan network is NP-complete
This page was built for publication: The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
