The (K,k)-Capacitated Spanning Tree Problem
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.
- 2.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)Google Scholar
- 3.Gamvros, I., Raghavan, S., Golden, B.: An evolutionary approach to the multi-level Capacitated Minimum Spanning Tree problem. Technical report (2002)Google Scholar