On survivable access network design: Complexity and algorithms

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 709-717

  Xu, Dahai ^a   Anshelevich, Elliot ^b   Chiang, Mung ^c  

^a AT AND T LABS RESEARCH   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS NETWORK; COVER PROBLEMS; INFOCOM;

COMPUTATIONAL GEOMETRY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PORT TERMINALS; TOPOLOGY; TREES (MATHEMATICS);

PROBLEM SOLVING;

EID: 51349132800     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.46     Document Type: Conference Paper

References (22)

1. M. Andrews and L. Zhang. "The access network design problem," in IEEE symposium on Foundations of Computer Science, FOCS '98, Palo Alto, CA, 1998, pp. 40-59.
2. A. Patzer, "Algorithms for a reliable access network." Master's thesis, Princeton University, 2004.
3. M. Chiang, J. Huang, D. Xu, Y. Yi, C. Tan, and R. Cendrillon, "Fast copper for broadband access," in Proc. 44th Allerton Conference, Sep. 2006.
4. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian, "Buy-at-bulk network design: approximating the single-sink edge installation problem," in ACM-SIAM symposium on Discrete algorithms, SODA '97, New Orleans, LA, 1997, pp. 619-628.
5. V. V. Vazirani, Approximation algorithms. New York, NY, USA: Springer-Verlag New York. Inc., 2001.
6. K. Jain, "A factor 2 approximation algorithm for the generalized Steiner network problem," Combinatorica, vol. 21, no. 1, pp. 39-60, 2001.
7. S. Guha, A. Meyerson, and K. Munagala, "A constant factor approximation for the single sink edge installation problems," in ACM symposium on Theoiy of computing, STOC'01, Crete, Greece, 2001, pp. 383-388.
8. J. Edmonds, "Maximum matching and a polyhedron with 0-1 vertices," Journal of Reseaivh at the National Bureau of Standards, 69B, pp. 125-130, 1965.
9. H. N. Gabow, "Implementation of algorithms for maximum matching on nonbipartite graphs," Ph.D. dissertation, Stanford University, 1974.
10. W. Cook and A. Rohe, "Computing minimum-weight perfect matchings," INFORMS J. on Computing, vol. 11, no. 2, pp. 138-148, 1999.
11. A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency. Springer-Verlag, 2003.
12. A. Agrawal, P. Klein, and R. Ravi, "When trees collide: An approximation algorithm for the generalized Steiner problem on networks," SIAM J. Comput., vol. 24, no. 3, pp. 440-456, 1995.
13. H. Kerivin, D. Nace, and T.-T.-L. Pham, "Design of capacitated survivable networks with a single facility." IEEE/ACM Transactions on Networking, vol. 13, no. 2, pp. 248-261, 2005.
14. M. Charikar and A. Karagiozova, "On non-uniform multicommodity buy-at-bulk network design," in ACM symposium on Theory of computing, STOC'05, Baltimore, MD, 2005, pp. 176-182.
15. N. Garg, R. Simha, and W. Xing, "Algorithms for budget-constrained survivable topology design," in IEEE ICC02, New York, NY, May 2002, pp. 2162-2166.
16. A. Meyerson, K. Munagala, and S. A. Plotkin, "Cost-distance: Two metric network design," in IEEE symposium on Foundations of Computer Science, FOCS'00, Redondo Beach, CA, 2000, pp. 624-630.
17. A. Meyerson, K. Munagala, and S. Plotkin, "Designing networks incrementally," in IEEE symposium on Foundations of Computer Science, FOCS'01, Las Vegas, NV, 2001, pp. 406-415.
18. K. Munagala, "Approximation algorithms for concave cost network flow problems," Ph.D. dissertation. Stanford University, Department of Computer Science, 2003.
19. M. Médard, S.G.Finn, R. Barry, and R. Gallager, "Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs,'" IEEE/ACM Transactions on Networking, vol. 7 no. 5, pp. 641-652, 1999.
20. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, New York, NY, USA: W. H. Freeman & Co., 1990.
21. E. Anshelevich and A. Karagiozova, "Terminal backup, 3d matching, and covering cubic graphs,'" in ACM symposium on Theory of computing, STOC'07, San Diego, CA, 2007.
22. Lo-Keng Hua et al., "Application of mathematical methods to wheat harvesting," Chinese Math, no. 2, pp. 77-91, 1962.