Advertisement

Improved Algorithm for Degree Bounded Survivable Network Design Problem

  • Anand Louis
  • Nisheeth K. Vishnoi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)

Abstract

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the degree of a degree constrained vertex v is at most 2 b(v) + 2. This improves upon the results of Lau and Singh [13] and Lau, Naor, Salavatipour and Singh [12].

Keywords

Edge Incident Network Design Problem Main Lemma Degree Bound Degree Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. In: STOC, pp. 769–778 (2008)Google Scholar
  2. 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)Google Scholar
  3. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 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)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Fürer, M., Raghavachari, B.: Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms 17(3), 409–423 (1994)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS, pp. 273–282 (2006)Google Scholar
  7. 7.
    Goemans, M.X., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60, 145–166 (1993)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Jain, K.: Factor 2 approximation algorithm for the generalized steiner network problem. In: FOCS, pp. 448–457 (1998)Google Scholar
  9. 9.
    Király, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. In: IPCO, pp. 259–272 (2008)Google Scholar
  10. 10.
    Klein, P.N., Krishnan, R., Raghavachari, B., Ravi, R.: Approximation algorithms for finding low-degree subgraphs. Networks 44(3), 203–215 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 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)Google Scholar
  12. 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)Google Scholar
  13. 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)Google Scholar
  14. 14.
    Lau, L.C., Singh, M.: Iterative rounding and relaxation. In: RIMS Kokyuroku Bessatsu, Kyoto (2009)Google Scholar
  15. 15.
    Melkonian, V., Tardos, É.: Algorithms for a network design problem with crossing supermodular demands. Networks 43(4), 256–265 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Singh, M.: Iterative methods in combinatorial optimization. PhD Thesis, Tepper School of Business, Carnegie Mellon University (2008)Google Scholar
  17. 17.
    Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC, pp. 661–670 (2007)Google Scholar
  18. 18.
    Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (March 2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Anand Louis
    • 1
  • Nisheeth K. Vishnoi
    • 2
  1. 1.College of ComputingGeorgia Tech.Atlanta
  2. 2.Microsoft Research IndiaBangalore

Personalised recommendations