Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

47

JCDCG
2004
Springer

favoriteEmaildiscussreport

147views Discrete Geometry» more JCDCG 2004»

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

14 years 4 months ago

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

Download i11www.iti.uni-karlsruhe.de

Marc Benkert, Alexander Wolff, Florian Widmann

Real-time Traffic

Discrete Geometry | JCDCG 2004 |

claim paper

Related Content

» A Simple 3Approximation of Minimum Manhattan Networks

» The minimum Manhattan network problem Approximations and exact solutions

» Implementation of Approximation Algorithms for the Multicast Congestion Problem

» Fast and qualityguaranteed data streaming in resourceconstrained sensor networks

» Maintaining connectivity in environments with obstacles

» Restoration Algorithms for Virtual Private Networks in the Hose Model

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	JCDCG
Authors	Marc Benkert, Alexander Wolff, Florian Widmann

Comments (0)