Sciweavers

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

94

Voted

STOC
2007
ACM

71views Algorithms» more STOC 2007»

Survivable network design with degree or order constraints

16 years 3 months ago

Survivable network design with degree or order constraints

Download www.andrew.cmu.edu

Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour

Real-time Traffic

Algorithms | STOC 2007 | Survivable Network Design |

claim paper

Related Content

» Improved Algorithm for Degree Bounded Survivable Network Design Problem

» The use of hoplimits to provide survivable ATM group communications

» Topological Design of Survivable IP Networks Using Metaheuristic Approaches

» Network design with weighted degree constraints

» LightTrail Networks Design and Survivability

» Resilient and survivable networks

» PTPlan MPLS A Tool for MPLS Network Dimensioning

» Bicriteria Network Design via Iterative Rounding

» Hardness and Approximation of the Survivable MultiLevel Fat Tree Problem

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh

Comments (0)