The (K,k)-Capacitated Spanning Tree Problem
- Cite this paper as:
- 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
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.
Unable to display preview. Download preview PDF.