Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Approximating k-generalized connectivity via collapsing HSTs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

An instance of the k -generalized connectivity problem consists of an undirected graph G=(V,E), whose edges are associated with non-negative costs, and a collection \({\mathcal{D}}=\{(S_{1},T_{1}),\ldots,(S_{d},T_{d})\}\) of distinct demands, each of which comprises a pair of disjoint vertex sets. We say that a subgraph ℋ⊆G connects a demand (S i ,T i ) when it contains a path with one endpoint in S i and the other in T i . Given an integer parameter k, the goal is to identify a minimum cost subgraph that connects at least k demands in \({\mathcal{D}}\) .

Alon, Awerbuch, Azar, Buchbinder and Naor (SODA ’04) seem to have been the first to consider the generalized connectivity paradigm as a unified machinery for incorporating multiple-choice decisions into network formation settings. Their main contribution in this context was to devise a multiplicative-update online algorithm for computing log-competitive fractional solutions, and to propose provably-good rounding procedures for important special cases. Nevertheless, approximating the generalized connectivity problem in its unconfined form, where one makes no structural assumptions about the underlying graph and collection of demands, has remained an open question up until a recent O(log 2 nlog 2 d) approximation due to Chekuri, Even, Gupta and Segev (SODA ’08). Unfortunately, the latter result does not extend to connecting a pre-specified number of demands. Furthermore, even the simpler case of singleton demands has been established as a challenging computational task, when Hajiaghayi and Jain (SODA ’06) related its inapproximability to that of dense k -subgraph.

In this paper, we present the first non-trivial approximation algorithm for k-generalized connectivity, which is derived by synthesizing several techniques originating in probabilistic embeddings of finite metrics, network design, and randomization. Specifically, our algorithm constructs, with constant probability, a feasible subgraph whose cost is within a factor of O(n 2/3⋅polylog(n,k)) of optimal. We believe that the fundamental approach illustrated in the current writing is of independent interest, and may be applicable in other settings as well.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agrawal A, Klein PN, Ravi R (1995) When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM J Comput 24(3):440–456

    Article  MATH  MathSciNet  Google Scholar 

  • Alon N, Awerbuch B, Azar Y, Buchbinder N, Naor J (2006) A general approach to online network optimization problems. ACM Trans Algorithms 2(4):640–660

    Article  MathSciNet  Google Scholar 

  • Arora S, Karger DR, Karpinski M (1999) Polynomial time approximation schemes for dense instances of NP-hard problems. J Comput Syst Sci 58(1):193–210

    Article  MATH  MathSciNet  Google Scholar 

  • Arora S, Lund C, Motwani R, Sudan M, Szegedy M (1998) Proof verification and the hardness of approximation problems. J ACM 45(3):501–555

    Article  MATH  MathSciNet  Google Scholar 

  • Asahiro Y, Iwama K, Tamaki H, Tokuyama T (2000) Greedily finding a dense subgraph. J Algorithms 34(2):203–221

    Article  MATH  MathSciNet  Google Scholar 

  • Awerbuch B, Azar Y, Bartal Y (2004) On-line generalized Steiner problem. Theor Comput Sci 324(23):313–324

    MATH  MathSciNet  Google Scholar 

  • Bartal Y (1996) Probabilistic approximations of metric spaces and its algorithmic applications. In: Proceedings of the 37th annual IEEE symposium on foundations of computer science, pp 184–193

  • Bartal Y (1998) On approximating arbitrary metrics by tree metrics. In: Proceedings of the 30th annual ACM symposium on the theory of computing, pp 161–168

  • Bartal Y, Charikar M, Raz D (2001) Approximating min-sum k-clustering in metric spaces. In: Proceedings of the 33rd annual ACM symposium on the theory of computing, pp 11–20

  • Bateman CD, Helvig CS, Robins G, Zelikovsky A (1997) Provably good routing tree construction with multi-port terminals. In: Proceedings of the international symposium on physical design, pp 96–102

  • Berman P, Coulston C (1997) On-line algorithms for Steiner tree problems (extended abstract). In: Proceedings of the 29th annual ACM symposium on the theory of computing, pp 344–353

  • Charikar M, Chekuri C, Cheung T-Y, Dai Z, Goel A, Guha S, Li M (1999) Approximation algorithms for directed Steiner problems. J Algorithms 33(1):73–91

    Article  MATH  MathSciNet  Google Scholar 

  • Charikar M, Chekuri C, Goel A, Guha S (1998) Rounding via trees: Deterministic approximation algorithms for group Steiner trees and k-median. In: Proceedings of the 30th annual ACM symposium on the theory of computing, pp 114–123

  • Chekuri C, Even G, Gupta A, Segev D (2008) Set connectivity problems in undirected graphs and the directed Steiner network problem. In: Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms, pp 532–541

  • Chekuri C, Even G, Kortsarz G (2006) A greedy approximation algorithm for the group Steiner problem. Discrete Appl Math 154(1):15–34

    Article  MATH  MathSciNet  Google Scholar 

  • Chekuri C, Hajiaghayi MT, Kortsarz G, Salavatipour MR (2006) Approximation algorithms for non-uniform buy-at-bulk network design. In: Proceedings of the 47th annual IEEE symposium on foundations of computer science, pp 677–686

  • Chekuri C, Hajiaghayi MT, Kortsarz G, Salavatipour MR (2007) Approximation algorithms for node-weighted buy-at-bulk network design. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, pp 1265–1274

  • Chudak FA, Roughgarden T, Williamson DP (2004) Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation. Math Program 100(2):411–421

    Article  MATH  MathSciNet  Google Scholar 

  • Even G, Kortsarz G, Slany W (2005) On network design problems: Fixed cost flows and the covering Steiner problem. ACM Trans Algorithms 1(1):74–101

    Article  MathSciNet  Google Scholar 

  • Fakcharoenphol J, Rao S, Talwar K (2004) A tight bound on approximating arbitrary metrics by tree metrics. J Comput Syst Sci 69(3):485–497

    Article  MATH  MathSciNet  Google Scholar 

  • Feige U, Kortsarz G, Peleg D (2001) The dense k-subgraph problem. Algorithmica 29(3):410–421

    Article  MATH  MathSciNet  Google Scholar 

  • Feige U, Langberg M (2001) Approximation algorithms for maximization problems arising in graph partitioning. J Algorithms 41(2):174–211

    Article  MATH  MathSciNet  Google Scholar 

  • Feldman M, Kortsarz G, Nutov Z (2009) Improved approximating algorithms for directed Steiner forest. In: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, pp 922–931

  • Fleischer L, Könemann J, Leonardi S, Schäfer G (2006) Simple cost sharing schemes for multi-commodity rent-or-buy and stochastic Steiner tree. In: Proceedings of the 38th annual ACM symposium on theory of computing, pp 663–670

  • Garg N, Konjevod G, Ravi R (2000) A polylogarithmic approximation algorithm for the group Steiner tree problem. J Algorithms 37(1):66–84

    Article  MATH  MathSciNet  Google Scholar 

  • Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J Comput 24(2):296–317

    Article  MATH  MathSciNet  Google Scholar 

  • Goemans MX, Williamson DP (1996) The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum DS (ed) Approximation algorithms for NP-hard problems. PWS Publishing Company, Boston

    Google Scholar 

  • Gupta A, Hajiaghayi M, Nagarajan V, Ravi R (2007) Dial a ride from k-forest. In: Proceedings of the 15th annual European symposium on algorithms, pp 241–252

  • Gupta A, Könemann J, Leonardi S, Ravi R, Schäfer G (2007) An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, pp 1153–1162

  • Gupta A, Kumar A, Pál M, Roughgarden T (2003) Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 44th annual IEEE symposium on foundations of computer science, pp 606–615

  • Gupta A, Pál M (2005) Stochastic Steiner trees without a root. In: Proceedings on the 32nd international colloquium on automata, languages and programming, pp 1051–1063

  • Hajiaghayi MT, Jain K (2006) 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 algorithms, pp 631–640

  • Halperin E, Kortsarz G, Krauthgamer R, Srinivasan A, Wang N (2007) Integrality ratio for group Steiner trees and directed Steiner trees. SIAM J Comput 36(5):1494–1511

    Article  MATH  MathSciNet  Google Scholar 

  • Halperin E, Krauthgamer R (2003) Polylogarithmic inapproximability. In: Proceedings of the 35th annual ACM symposium on theory of computing, pp 585–594

  • Han Q, Ye Y, Zhang J (2002) An improved rounding method and semidefinite programming relaxation for graph partition. Math Program 92(3):509–535

    Article  MATH  MathSciNet  Google Scholar 

  • Indyk P (2001) Algorithmic applications of low-distortion geometric embeddings. Tutorial in: Proceedings of the 42nd annual IEEE symposium on foundations of computer science, pp 10–33

  • Indyk P, Matousek J (2004) Low distortion embeddings of finite metric spaces. In: Goodman JE, O’Rourke J (eds) Handbook of discrete and computational geometry, 2nd edn. CRC Press, Boca Raton

    Google Scholar 

  • Kamath A, Motwani R, Palem KV, Spirakis PG (1994) Tail bounds for occupancy and the satisfiability threshold conjecture. In: Proceedings of the 35th annual IEEE symposium on foundations of computer science, pp 592–603

  • Kortsarz G, Peleg D (1993) On choosing a dense subgraph. In: Proceedings of the 34th annual IEEE symposium on foundations of computer science, pp 692–701

  • Kumar A, Gupta A, Roughgarden T (2002) A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. In: Proceedings of the 43rd annual IEEE symposium on foundations of computer science, pp 333–344

  • Matousek J (2002) Lectures on discrete geometry. Graduate texts in mathematics, vol 212. Springer, Berlin

    MATH  Google Scholar 

  • Mendel M, Naor A (2007) Maximum gradient embeddings and monotone clustering. In: Proceedings of the 10th international workshop on approximation algorithms for combinatorial optimization problems, pp 242–256

  • Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43(3):425–440

    Article  MATH  MathSciNet  Google Scholar 

  • Ravi R (2006) Matching based augmentations for approximating connectivity problems. In: Proceedings of the 7th Latin American theoretical informatics symposium, pp 13–24

  • Reich G, Widmayer P (1989) 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

  • Robins G, Zelikovsky A (2005) Tighter bounds for graph Steiner tree approximation. SIAM J Discrete Math 19(1):122–134

    Article  MATH  MathSciNet  Google Scholar 

  • Segev D, Segev G (2006) Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing. In: Proceedings of the 14th annual European symposium on algorithms, pp 600–611

  • Sharma Y, Swamy C, Williamson DP (2007) Approximation algorithms for prize collecting forest problems with submodular penalty functions. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, pp 1275–1284

  • Slavík P (1997) Improved performance of the greedy algorithm for partial cover. Inform Process Lett 64(5):251–254

    Article  MathSciNet  Google Scholar 

  • Srinivasan A (2001) New approaches to covering and packing problems. In: Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms, pp 567–576

  • Zosin L, Khuller S (2002) On directed Steiner trees. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 59–63

Download references

Author information

Authors and Affiliations

  1. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Danny Segev

Authors
  1. Danny Segev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Danny Segev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Segev, D. Approximating k-generalized connectivity via collapsing HSTs. J Comb Optim 21, 364–382 (2011). https://doi.org/10.1007/s10878-009-9256-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-009-9256-3

Keywords

Search

Navigation