Survivable network design with degree or order constraints

No abstract is available in the live database for this paper.

Authors

• Lap Chi Lau
• Joseph Naor
• Mohammad R. Salavatipour
• Mohit Singh

Keywords

• NP-hard problems
• approximation algorithms
• bounded degree
• iterative rounding
• network design