Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems

Operations Research Letters

Volumn 29, Issue 3, 2001, Pages 99-106

  Balakrishnan, Anantaram ^a   Magnanti, Thomas L ^b   Mirchandani, Prakash ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b Massachusetts Institute of Technology Cambridge   (United States)

^c UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MATHEMATICAL MODELS; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

SOLUTION-DOUBLING TECHNIQUES; STEINER NODES;

TELECOMMUNICATION NETWORKS;

EID: 0035476770     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00094-3     Document Type: Article

References (11)

1. Designing hierarchical survivable networks
2. Maximum matching and a polyhedron with 0-1 vertices
3. Survivable networks, linear programming relaxations and the parsimonious property
4. Approximation schemes for network design problems
5. Design of survivable communications networks
6. A factor 2 approximation algorithm for the generalized Steiner network problem
7. Minimum-weight two-connected spanning networks
8. An approximation solution for the Steiner problem in graphs
9. A primal-dual algorithm for generalized steiner network problems