Approximating the generalized minimum Manhattan network problem
DOI10.1007/978-3-642-45030-3_67zbMATH Open1386.68191OpenAlexW3158824989MaRDI QIDQ2872136FDOQ2872136
Authors: Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Alexander Wolff, Sankar Veeramoni 
Publication date: 14 January 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.1482
Recommendations
- Approximating the generalized minimum Manhattan network problem
- Approximating minimum Manhattan networks in higher dimensions
- Approximating minimum Manhattan networks in higher dimensions
- Dynamic programming approach to the generalized minimum Manhattan network problem
- Dynamic programming approach to the generalized minimum Manhattan network problem
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (7)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
- Approximating the generalized minimum Manhattan network problem
- Approximating minimum Manhattan networks in higher dimensions
- Minimum Manhattan network is NP-complete
- Dynamic programming approach to the generalized minimum Manhattan network problem
- Dynamic programming approach to the generalized minimum Manhattan network problem
This page was built for publication: Approximating the generalized minimum Manhattan network problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872136)
