Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs

  • Erik D. Demaine
  • MohammadTaghi Hajiaghayi
  • Philip N. Klein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5555)


We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable approximation ratio in general graphs is Θ(logn), and nothing better was previously known for planar graphs. We give a constant-factor approximation for planar graphs. Our algorithm generalizes to allow as input any nontrivial minor-closed graph family, and also generalizes to address other optimization problems such as Steiner forest, prize-collecting Steiner tree, and network-formation games.

The second problem we address is group Steiner tree: given a graph with edge weights and a collection of groups (subsets of nodes), find a minimum-weight connected subgraph that includes at least one node from each group. The best approximation ratio known in general graphs is O(log3 n), or O(log2 n) when the host graph is a tree. We obtain an O(log n polyloglog n) approximation algorithm for the special case where the graph is planar embedded and each group is the set of nodes on a face. We obtain the same approximation ratio for the minimum-weight tour that must visit each group.


Approximation Algorithm Planar Graph Steiner Tree Network Design Problem Steiner Tree Problem 
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.
    Abraham, I., Bartal, Y., Neiman, O.: Nearly tight low stretch spanning trees. In: Proceedings of the 49th Annual Symposium on Foundations of Computer Science, pp. 781–790 (2008)Google Scholar
  2. 2.
    Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem on networks. In: STOC, pp. 134–144 (1991)Google Scholar
  3. 3.
    Andrews, M.: Hardness of buy-at-bulk network design. In: Proceedings of the 45th Symposium on Foundations of Computer Science, pp. 115–124 (2004)Google Scholar
  4. 4.
    Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 295–304 (2004)Google Scholar
  5. 5.
    Arkin, E.M., Hassin, R.: Approximation algorithms for the geometric covering salesman problem. Discrete Applied Mathematics 55(3), 197–218 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bartal, Y.: On approximating arbitrary metrices by tree metrics. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 161–168 (1998)Google Scholar
  7. 7.
    Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Programming 59(3, ser. A), 413–420 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chekuri, C., Khanna, S., Shepherd, F.B.: Multicommodity flow, well-linked terminals, and routing problems. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 183–192 (2005)Google Scholar
  9. 9.
    Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum-weight vertex separators. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 563–572 (2005)Google Scholar
  11. 11.
    Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group steiner tree problem. Journal of Algorithms 37(1), 66–84 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296–317 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for NP-hard Problems, ch. 4, pp. 144–191. PWS, Boston (1997)Google Scholar
  14. 14.
    Gudmundsson, J., Levcopoulos, C.: A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing 6(4), 469–488 (Winter 1999)Google Scholar
  15. 15.
    Guha, S., Moss, A., Naor, J., Schieber, B.: Efficient recovery from power outage. In: STOC, pp. 574–582 (1999)Google Scholar
  16. 16.
    Hajiaghayi, M.T., Jain, K.: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 631–640 (2006)Google Scholar
  17. 17.
    Hajiaghayi, M.T., Kleinberg, R.D., Leighton, T., Raecke, H.: Oblivious routing on node-capacitated and directed graphs. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, pp. 782–790 (2005)Google Scholar
  18. 18.
    Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of the the 35th Annual ACM Symposium on Theory of Computing, pp. 585–594 (2003)Google Scholar
  19. 19.
    Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972), pp. 85–103. Plenum, New York (1972)Google Scholar
  20. 20.
    Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 19(1), 104–115 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Kostochka, A.V.: Lower bound of the Hadwiger number of graphs by their average degree. Combinatorica 4(4), 307–316 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. J. Algorithms 28(1), 142–171 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Mata, C.S., Mitchell, J.S.B.: Approximation algorithms for geometric tour and network design problems (extended abstract). In: Proceedings of the 11th Annual Symposium on Computational Geometry, Vancouver, Canada, pp. 360–369 (1995)Google Scholar
  24. 24.
    Mitchell, J.S.B.: A PTAS for TSP with neighborhoods among fat regions in the plane. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11–18 (2007)Google Scholar
  25. 25.
    Moss, A., Rabani, Y.: Approximation algorithms for constrained node weighted steiner tree problems. SIAM Journal on Computing 37(2), 460–481 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 475–484 (1997)Google Scholar
  27. 27.
    Reich, G., Widmayer, P.: Beyond steiner’s problem: a VLSI oriented generalization. In: Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 196–210 (1990)Google Scholar
  28. 28.
    Safra, S., Schwartz, O.: On the complexity of approximating TSP with neighborhoods and related problems. Computational Complexity 14(4), 281–307 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Thomason, A.: The extremal function for complete minors. Journal of Combinatorial Theory, Series B 81(2), 318–338 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    West, D.B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River (1996)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Erik D. Demaine
    • 1
  • MohammadTaghi Hajiaghayi
    • 2
  • Philip N. Klein
    • 3
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA
  2. 2.AT&T Labs — ResearchFlorham ParkUSA
  3. 3.Department of Computer ScienceBrown UniversityProvidenceUSA

Personalised recommendations