Abstract
We consider the following network design problem; Given a vertex set V with a metric cost c on V, an integer k≥1, and a degree specification b, find a minimum cost k-edge-connected multigraph on V under the constraint that the degree of each vertex v∈V is equal to b(v). This problem generalizes metric TSP. In this paper, we propose that the problem admits a ρ-approximation algorithm if b(v)≥2, v∈V, where ρ=2.5 if k is even, and ρ=2.5+1.5/k if k is odd. We also prove that the digraph version of this problem admits a 2.5-approximation algorithm and discuss some generalization of metric TSP.
This research was partially supported by the Scientific Grant-in-Aid from Ministry of Education, Culture, Sports, Science and Technology of Japan.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM Journal on Discrete Mathematics 5, 25–53 (1992)
Frank, A.: On a theorem of Mader. Discrete Mathematics 191, 49–57 (1992)
Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM Journal of Computing 7, 178–193 (1978)
Fukunaga, T., Nagamochi, H.: Approximating minimum cost multigraphs of specified edge-connectivity under degree bounds. In: Proceedings of the 9th Japan-Korea Joint Workshop on Algorithm and Computation, pp. 25–32 (2006)
Fukunaga, T., Nagamochi, H.: Approximating a generalization of metric TSP. IEICE Transactions on Information and Systems (to appear)
Goemans, M.X., Bertsimas, D.J.: Survivable networks, linear programming relaxations and the parsimonious property. Mathematical Programming 60, 145–166 (1993)
Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems, Ch. 4, pp. 144–191. PWS (1997)
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester (1985)
Mader, W.: A reduction method for edge-connectivity in graphs. Annals of Discrete Mathematics 3, 145–164 (1978)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
Vazirani, V.: Approximation Algorithm. Springer, Heidelberg (2001)
Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study 13, 121–134 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fukunaga, T., Nagamochi, H. (2007). Network Design with Edge-Connectivity and Degree Constraints. In: Erlebach, T., Kaklamanis, C. (eds) Approximation and Online Algorithms. WAOA 2006. Lecture Notes in Computer Science, vol 4368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11970125_15
Download citation
DOI: https://doi.org/10.1007/11970125_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69513-4
Online ISBN: 978-3-540-69514-1
eBook Packages: Computer ScienceComputer Science (R0)