Sciweavers

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

138

Voted

COMPGEOM
2009
ACM

122views Discrete Geometry» more COMPGEOM 2009»

Minimum Manhattan network is NP-complete

15 years 1 months ago

Minimum Manhattan network is NP-complete

Download i.cs.hku.hk

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

Real-time Traffic

COMPGEOM 2009 | Discrete Geometry |

claim paper

Related Content

» A Simple 3Approximation of Minimum Manhattan Networks

» The Minimum Manhattan Network Problem A Fast Factor3 Approximation

» Approximating Minimum Manhattan Networks

» The minimum Manhattan network problem Approximations and exact solutions

» Impact of Constraints on the Complexity of Dynamic Spectrum Assignment

» Link Scheduling in a Single Broadcast Domain Underwater Networks

» On New Approaches of Assessing Network Vulnerability Hardness and Approximation

» The Role of Angularity in Route Choice

Post Info
More Details (n/a)

Added	16 Feb 2011
Updated	16 Feb 2011
Type	Journal
Year	2009
Where	COMPGEOM
Authors	Francis Y. L. Chin, Zeyu Guo, He Sun

Comments (0)