Abstract
This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that the problem can be approximated within a constant factor, and present better approximations when k is 1 or 2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Altinkemer, K., Gavish, B.: Heuristics with constant error guarantees for the design of tree networks. Management Sci. 34, 331–341 (1988)
Deo, N., Kumar, N.: Computation of constrained spanning trees: a unified approach. Lecture Notes in Econ. and Math. Systems, vol. 450, pp. 194–220. Springer, Berlin (1997)
Gamvros, I., Raghavan, S., Golden, B.: An evolutionary approach to the multi-level Capacitated Minimum Spanning Tree problem. Technical report (2002)
Gavish, B.: Formulations and algorithms for the capacitated minimal directed tree problem. J. Assoc. Comput. Mach. 30, 118–132 (1983)
Gavish, B.: Topological design of telecommunication networks - local access design methods. Annals of Operations Research 33, 17–71 (1991)
Gavish, B., Li, C.L., Simchi-Levi, D.: Analysis of heuristics for the design of tree networks. Annals of Operations Research 36, 77–86 (1992)
Gouveia, L., Lopes, M.J.: Using generalized capacitated trees for designing the topology of local access networks. Telecommunication Systems 7, 315–337 (1997)
Jothi, R., Raghavachari, B.: Survivable network design: the capacitated minimum spanning network problem. Inform. Process. Let. 91, 183–190 (2004)
Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms 1, 265–282 (2005)
Könemann, J., Ravi, R.: Primal-dual meets local search: approximating MSTs with nonuniform degree bounds. SIAM J. Comput. 34, 763–773 (2005)
Morsy, E., Nagamochi, H.: An improved approximation algorithm for capacitated multicast routings in networks. Theoretical Comput. Sci. 390, 81–91 (2008)
Papadimitriou, C.H.: The complexity of the capacitated tree problem. Networks 8, 217–230 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arkin, E.M., Guttmann-Beck, N., Hassin, R. (2010). The (K,k)-Capacitated Spanning Tree Problem. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)