The (K,k)-Capacitated Spanning Tree Problem

* Final gross prices may vary according to local VAT.

Get Access

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.