The (K, k)-capacitated spanning tree problem

Authors:
Esther M. Arkin;Nili Guttmann-Beck;Refael Hassin
Affiliations:
Department of Applied Mathematics and Statistics, State University of New York, Stony Brook, NY;Department of Computer Science, The Academic College of Tel-Aviv Yaffo, Yaffo, Israel;School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel
Venue:
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Year:
2010

Citing 7
Cited 0

Heuristics with constant error guarantees for the design of tree networks

Management Science
Analysis of heuristics for the design of tree networks

Annals of Operations Research - Special issue on operations research in telecommunications
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Journal of the ACM (JACM)
Survivable network design: the capacitated minimum spanning network problem

Information Processing Letters
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds

SIAM Journal on Computing
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design

ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for capacitated multicast routings in networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.