Sciweavers

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

11

COMGEO
2006
ACM

favoriteEmaildiscussreport

74views Applied Computing» more COMGEO 2006»

The minimum Manhattan network problem: Approximations and exact solutions

13 years 4 months ago

The minimum Manhattan network problem: Approximations and exact solutions

Download www1.informatik.uni-wuerzburg.de

Marc Benkert, Alexander Wolff, Florian Widmann, Ta

Real-time Traffic

Applied Computing | COMGEO 2006 |

claim paper

Related Content

» A Simple 3Approximation of Minimum Manhattan Networks

» The Minimum Manhattan Network Problem A Fast Factor3 Approximation

» Solving the Capacitated Local Access Network Design Problem

» The Minimum Generalized Vertex Cover Problem

» Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery

» Polynomial time approximation schemes for minimum disk cover problems

» Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by ClusteringBased Me...

» Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks

» A Memetic Algorithm for the Generalized Minimum VertexBiconnected Network Problem

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMGEO
Authors	Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe

Comments (0)