Improved algorithm for degree bounded survivable network design problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6139 LNCS, Issue , 2010, Pages 408-419

  Louis, Anand ^a   Vishnoi, Nisheeth K ^b  

^a Georgia Institute of Technology   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEGREE BOUNDS; IMPROVED ALGORITHM; MINIMUM COST; OPTIMAL SOLUTIONS; SUBGRAPHS; SURVIVABLE NETWORK DESIGN; UPPER BOUND;

GRAPH THEORY;

ALGORITHMS;

EID: 77954646012     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_38     Document Type: Conference Paper

References (18)

1. Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. In: STOC, pp. 769-778 (2008)
2. Chan, Y.H., Fung, W.S., Lau, L.C., Yung, C.K.: Degree bounded network design with metric costs. In: FOCS, pp. 125-134 (2008)
3. Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would edmonds do? augmenting paths and witnesses for degree-bounded msts. Algorithmica 55(1), 157-189 (2009)
4. Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Comput. Syst. Sci. 72(5), 838-867 (2006)
5. Fürer, M., Raghavachari, B.: Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms 17(3), 409-423 (1994)
6. Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS, pp. 273-282 (2006)
7. Goemans, M.X., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60, 145-166 (1993)
8. Jain, K.: Factor 2 approximation algorithm for the generalized steiner network problem. In: FOCS, pp. 448-457 (1998)
9. Király, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. In: IPCO, pp. 259-272 (2008)
10. Klein, P.N., Krishnan, R., Raghavachari, B., Ravi, R.: Approximation algorithms for finding low-degree subgraphs. Networks 44(3), 203-215 (2004) (Pubitemid 39301559)
11. Könemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In: STOC, pp. 537-546 (2000)
12. Lau, L.C., Naor, J., Salavatipour, M.R., Singh, M.: Survivable network design with degree or order constraints. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 651-660. ACM, New York (2007)
13. Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. In: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 759-768. ACM, New York (2008)
14. Lau, L.C., Singh, M.: Iterative rounding and relaxation. In: RIMS Kokyuroku Bessatsu, Kyoto (2009)
15. Melkonian, V., Tardos, É.: Algorithms for a network design problem with crossing supermodular demands. Networks 43(4), 256-265 (2004) (Pubitemid 38838079)
16. Singh, M.: Iterative methods in combinatorial optimization. PhD Thesis, Tepper School of Business, Carnegie Mellon University (2008)
17. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC, pp. 661-670 (2007) (Pubitemid 47630785)
18. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (March 2001)