Sciweavers

9 search results - page 1 / 2
» Minimum Manhattan network is NP-complete
Sort
View
COLOGNETWENTE
2008
14 years 7 days ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze
COMPGEOM
2009
ACM
13 years 8 months ago
Minimum Manhattan network is NP-complete
Francis Y. L. Chin, Zeyu Guo, He Sun
JCDCG
2004
Springer
14 years 4 months ago
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Marc Benkert, Alexander Wolff, Florian Widmann
RANDOM
1999
Springer
14 years 3 months ago
Approximating Minimum Manhattan Networks
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...