The (K, k)-Capacitated Spanning Tree Problem

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.

• Type: Conference
• Year: 2010
• Where: AAIM
• Authors: Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
• Keywords: AAIM 2010, Algorithms, Capacity K, Present Better Approximations, Spanning Tree