The (K,k)-Capacitated Spanning Tree Problem

  • Esther M. Arkin
  • Nili Guttmann-Beck
  • Refael Hassin
Conference paper

DOI: 10.1007/978-3-642-14355-7_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6124)
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.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Esther M. Arkin
    • 1
  • Nili Guttmann-Beck
    • 2
  • Refael Hassin
    • 3
  1. 1.Department of Applied Mathematics and StatisticsState University of New YorkStony BrookUSA
  2. 2.Department of Computer ScienceThe Academic College of Tel-Aviv YaffoYaffoIsrael
  3. 3.School of Mathematical SciencesTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations