Approximating the generalized minimum Manhattan network problem

DOI10.1007/978-3-642-45030-3_67MaRDI QIDQ2872136zbMATHzbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Approximating the generalized minimum Manhattan network problem
• Dynamic programming approach to the generalized minimum Manhattan network problem
• Dynamic programming approach to the generalized minimum Manhattan network problem

Cited in

(6)

• Approximating the generalized minimum Manhattan network problem
• The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
• Minimum Manhattan network is NP-complete
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• 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)