Sciweavers

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

13

RANDOM
1999
Springer

favoriteEmaildiscussreport

105views Theoretical Computer Science» more RANDOM 1999»

Approximating Minimum Manhattan Networks

13 years 8 months ago

Approximating Minimum Manhattan Networks

Download alexandria.tue.nl

Joachim Gudmundsson, Christos Levcopoulos, Giri Na

Real-time Traffic

RANDOM 1999 | Theoretical Computer Science |

claim paper

Related Content

» A Simple 3Approximation of Minimum Manhattan Networks

» The Minimum Manhattan Network Problem A Fast Factor3 Approximation

» The minimum Manhattan network problem Approximations and exact solutions

» Minimum Manhattan network is NPcomplete

» On the construction of data aggregation tree with minimum energy cost in wireless sensor n...

» A distributed approximation algorithm for the minimum degree minimum weight spanning trees

» Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and SpiderCove...

» Approximating minimum size weaklyconnected dominating sets for clustering mobile ad hoc ne...

» Approximating minimum independent dominating sets in wireless networks

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	RANDOM
Authors	Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan

Comments (0)