A rounding algorithm for approximating minimum Manhattan networks-Reference-Cited by-同舟云学术

A rounding algorithm for approximating minimum Manhattan networks

Published:2008-01 Issue:1 Volume:390 Page:56-69
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chepoi Victor,Nouioua Karim,Vaxès Yann

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference17 articles.

1. M. Benkert, T. Shirabe, A. Wolff, The minimum Manhattan network problem: Approximations and exact solutions. in: Proc. 20th European Workshop on Computational Geometry, EWCG’04, 24–26 March 2004, Sevilla, 2004, pp. 209–212

2. M. Benkert, A. Wolff, F. Widmann, The minimum Manhattan network problem: A fast factor-3 approximation. in: Proc. 8th Japanese Conf. on Discrete and Computational Geometry, JCDCG’04, 8–11 October 2004, Tokyo, 2004, pp. 85–86

3. The minimum Manhattan network problem: Approximations and exact solutions;Benkert;Computational Geometry,2006

4. Finding efficient solutions for rectilinear distance location problems efficiently;Chalmet;European Journal of Operations Research,1981

5. Approximating a minimum Manhattan network;Gudmundsson;Nordic Journal of Computing,2001

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization with Pattern-Avoiding Input;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Linear-size planar Manhattan network for convex point sets;Computational Geometry;2022-01

3. Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem;Algorithmica;2021-09-04

4. On Minimum Generalized Manhattan Connections;Lecture Notes in Computer Science;2021

5. Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem;Lecture Notes in Computer Science;2020