Search Sciweavers | Sciweavers

9 search results - page 1 / 2

» Minimum Manhattan network is NP-complete

163

Voted

COLOGNETWENTE
2008

77views Optimization» more COLOGNETWENTE 2008»

A Simple 3-Approximation of Minimum Manhattan Networks

15 years 7 months ago

Download www.zaik.uni-koeln.de

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

claim paper

Read More »

174

Voted

COMPGEOM
2009
ACM

122views Discrete Geometry» more COMPGEOM 2009»

Minimum Manhattan network is NP-complete

15 years 3 months ago

Download i.cs.hku.hk

Francis Y. L. Chin, Zeyu Guo, He Sun

claim paper

Read More »

202

click to vote

JCDCG
2004
Springer

147views Discrete Geometry» more JCDCG 2004»

The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation

15 years 11 months ago

Download i11www.iti.uni-karlsruhe.de

Marc Benkert, Alexander Wolff, Florian Widmann

claim paper

Read More »

127

click to vote

RANDOM
1999
Springer

105views Theoretical Computer Science» more RANDOM 1999»

Approximating Minimum Manhattan Networks

15 years 10 months ago

Download alexandria.tue.nl

Joachim Gudmundsson, Christos Levcopoulos, Giri Na...

claim paper

Read More »

160

Voted

COMGEO
2006
ACM

74views Applied Computing» more COMGEO 2006»

The minimum Manhattan network problem: Approximations and exact solutions

15 years 5 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers