Algorithmic Aspects in Information and Management

Volume 6124 of the series Lecture Notes in Computer Science pp 25-34

The (K,k)-Capacitated Spanning Tree Problem

  • Esther M. ArkinAffiliated withDepartment of Applied Mathematics and Statistics, State University of New York
  • , Nili Guttmann-BeckAffiliated withDepartment of Computer Science, The Academic College of Tel-Aviv Yaffo
  • , Refael HassinAffiliated withSchool of Mathematical Sciences, Tel-Aviv University

* Final gross prices may vary according to local VAT.

Get Access


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.