A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 279-287

  Mihail, Milena ^a   Shallcross, David ^b   Dean, Nate ^c   Mostrel, Marco ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COST EFFECTIVENESS; IMAGE CODING; OPTIMAL SYSTEMS; PRODUCT DESIGN; SOFTWARE TESTING; TOPOLOGY;

BACK-BONE NETWORK; COMMERCIAL APPLICATIONS; COMMON CHANNEL SIGNALING; NETWORK SURVIVABILITY; PERFORMANCE GUARANTEES; PRIMAL-DUAL APPROXIMATIONS; STEINER PROBLEMS; SURVIVABLE NETWORK DESIGN;

APPROXIMATION ALGORITHMS;

EID: 33748921512     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. H. Gabow, M. Goemans, and D. Williamson, "An Efficient Approximation Algorithm for Survivable Network Design Problems", Proc. IPCO 93.
2. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman (1979).
3. M. Goemans and D. Williamson, "A General Approximation Technique for Constrained Forest Problems", Proc. SODA 92.
4. M. Goemans, A. Goldberg, S. Piotkin, D. Shmoys, E. Tardos, and D. Williamson, "Improved Approximation Algorithms for Network Design Problems", Proc. SODA 94.
5. D. Minoli, Telecommunications Technology Handbook, Artech House, Boston-London, 1991.
6. G. Partridge, Gigabit Networking, Addison Wesley, 1994.
7. R. Ravi and P. Klein, "When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems", Proc. IPCO 93.
8. R. Ravi and D. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems", Proc. SODA 95.
9. D. Williamson and M. Goemans, "Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Problem", Proc. SODA 94.
10. D. Williamson, M. Goemans, M. Mihail, and V. Vazirani, "A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems", Proc. STOC 93.