Abstract
We study several network design problems with degree constraints. For the degree-constrained 2-connected subgraph problem we obtain a factor 6 violation for the degrees with 4 approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2006). Then we consider the problem of finding an arborescence with at least k terminals and with minimum maximum outdegree. We show that the natural LP-relaxation has a gap of \(\Omega\left(\sqrt{k}\right)\) or \(\Omega\left(n^{1/4}\right)\) with respect to the multiplicative degree bound violation. We overcome this hurdle by a combinatorial \(O(\sqrt{(k\log k)/\Delta^*})\)-approximation algorithm, where Δ* denotes the maximum degree in the optimum solution. We also give an Ω(logn) lower bound on approximating this problem. Then we consider the undirected version of this problem, however, with an extra diameter constraint, and give an Ω(logn) lower bound on the approximability of this version. Finally, we consider a closely related prize-collecting degree-constrained Steiner Network problem. We obtain several results in this direction by reducing the prize-collecting variant to the regular one.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. SIAM J. Computing 39(4), 1413–1431 (2009)
Bar-Ilan, J., Kortsarz, G., Peleg, D.: Generalized submodular cover problems and applications. Theoretical Computer Science 250, 179–200 (2001)
Elkin, M., Kortsarz, G.: An approximation algorithm for the directed telephone multicast problem. Algorithmica 45(4), 569–583 (2006)
Feder, T., Motwani, R., Zhu, A.: k-connected spanning subgraphs of low degree. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 041 (2006)
Fürer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one of optimal. J. Algorithms 17(3), 409–423 (1994)
Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66–84 (2000)
Goemans, M.: Bounded degree minimum spanning trees. In: FOCS, pp. 273–282 (2006)
Hajiaghayi, M., Nasri, A.: Prize-collecting steiner networks via iterative rounding. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 515–526. Springer, Heidelberg (2010)
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39–60 (2001)
Klein, P., Krishnan, R., Raghavachari, B., Ravi, R.: Approximation through local optimality: designing networks with small degree. Networks 44, 203–215 (2004)
Kortsarz, G., Nutov, Z.: Approximating minimum cost connectivity problems. In: Gonzalez, T.F. (ed.) Approximation Algorithms and Metahueristics, ch. 58, Chapman and Hall/CRC (2007)
Lau, L.C., Naor, J., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. SIAM J. Computing 39(3), 1062–1087 (2009)
Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. In: STOC, pp. 759–768 (2008)
Louis, A., Vishnoi, N.: Improved algorithm for degree bounded survivable network design problem. In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 408–419. Springer, Heidelberg (2010)
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)
Nutov, Z.: Approximating directed weighted-degree constrained networks. Theoretical Computer Science 412(8-10), 901–912 (2011)
Ravi, R., Raghavachari, B., Klein, P.: Approximation through local optimality: Designing networks with small degree. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 279–290. Springer, Heidelberg (1992)
Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC, pp. 661–670 (2007)
Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385–393 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khandekar, R., Kortsarz, G., Nutov, Z. (2011). Network-Design with Degree Constraints. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2011 2011. Lecture Notes in Computer Science, vol 6845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22935-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-22935-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22934-3
Online ISBN: 978-3-642-22935-0
eBook Packages: Computer ScienceComputer Science (R0)