Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs

  • Chandra Chekuri
  • Alina Ene
  • Ali Vakilian
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7391)


We consider node-weighted network design in planar and minor-closed families of graphs. In particular we focus on the edge-connectivity survivable network design problem (EC-SNDP). The input consists of a node-weighted undirected graph G = (V,E) and integral connectivity requirements r(uv) for each pair of nodes uv. The goal is to find a minimum node-weighted subgraph H of G such that, for each pair uv, H contains r(uv) edge-disjoint paths between u and v. Our main result is an O(k)-approximation algorithm for EC-SNDP where k =  max uv r(uv) is the maximum requirement. This improves the O(k logn)-approximation known for node-weighted EC-SNDP in general graphs [15]. Our algorithm and analysis applies to the more general problem of covering a proper function with maximum requirement k. Our result is inspired by, and generalizes, the work of Demaine, Hajiaghayi and Klein [5] who gave constant factor approximation algorithms for node-weighted Steiner tree and Steiner forest problems (and more generally covering 0-1 proper functions) in planar and minor-closed families of graphs.


Planar Graph Steiner Tree Steiner Tree Problem Blue Edge Special Vertex 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing 24(3), 440–456 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Byrka, J., Grandoni, F., Rothvoß, T., Sanità, L.: An improved LP-based approximation for Steiner tree. In: Proc. of ACM STOC 2010, pp. 583–592 (2010)Google Scholar
  3. 3.
    Cheriyan, J., Vempala, S., Vetta, A.: Network design via iterative rounding of setpair relaxations. Combinatorica 26(3), 255–275 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Chuzhoy, J., Khanna, S.: An O(k 3 logn)-approximation algorithm for vertex-connectivity survivable network design. In: Proc. of FOCS, pp. 437–441. IEEE (2009)Google Scholar
  5. 5.
    Demaine, E.D., Hajiaghayi, M., Klein, P.N.: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 328–340. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Goemans, M.X., Goldberg, A.V., Plotkin, S., Shmoys, D.B., Tardos, E., Williamson, D.P.: Improved approximation algorithms for network design problems. In: Proc. of ACM-SIAM SODA, pp. 223–232 (1994)Google Scholar
  7. 7.
    Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing 24, 296 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Approximation Algorithms for NP-Hard Problems, pp. 144–191. PWS Publishing Co. (1996)Google Scholar
  9. 9.
    Gupta, A., Könemann, J.: Approximation algorithms for network design: A survey. Surveys in Operations Research and Management Science 16(1), 3–20 (2011)CrossRefGoogle Scholar
  10. 10.
    Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39–60 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Jain, K., Mandoiu, I., Vazirani, V.V., Williamson, D.P.: A primal-dual schema based approximation algorithm for the element connectivity problem. Journal of Algorithms 45(1), 1–15 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 19(1), 104–115 (1995)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Handbook on Approximation Algorithms and Metaheuristics. Chapman and Hall/CRC (2007)Google Scholar
  14. 14.
    Moldenhauer, C.: Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 748–759. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  15. 15.
    Nutov, Z.: Approximating Steiner networks with node-weights. SIAM Journal of Computing 39(7), 3001–3022 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Nutov, Z.: Approximating Steiner network activation problems. In: Proc. of LATIN (2012)Google Scholar
  17. 17.
    Panigrahi, D.: Survivable network design problems in wireless networks. In: Proc. of ACM-SIAM SODA (2011)Google Scholar
  18. 18.
    Williamson, D.P., Goemans, M.X., Mihail, M., Vazirani, V.V.: A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15(3), 435–454 (1995)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Chandra Chekuri
    • 1
  • Alina Ene
    • 1
  • Ali Vakilian
    • 1
  1. 1.Dept. of Computer ScienceUniversity of IllinoisUrbanaUSA

Personalised recommendations