论文信息 - The (K, k)-capacitated spanning tree problem

The (K, k)-capacitated spanning tree problem

Abstract This paper considers a generalization of the capacitated spanning tree problem, in which some of the vertices 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.

Esther M. Arkin | Refael Hassin | Nili Guttmann-Beck

[1] Balaji Raghavachari,et al. Survivable network design: the capacitated minimum spanning network problem , 2004, Inf. Process. Lett..

[2] R. Ravi,et al. Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds , 2005, SIAM J. Comput..

[3] Christos H. Papadimitriou,et al. The complexity of the capacitated tree problem , 1978, Networks.

[4] Bezalel Gavish,et al. Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[5] Hiroshi Nagamochi,et al. An improved approximation algorithm for capacitated multicast routings in networks , 2008, Theor. Comput. Sci..

[6] B. Gavish,et al. Heuristics with Constant Error Guarantees for the Design of Tree Networks , 1988 .

[7] S. Raghavan,et al. An Evolutionary Approach to the Multi-Level Capacitated Minimum Spanning Tree Problem , 2003 .

[8] Luís Gouveia,et al. Using generalized capacitated trees for designing the topology of local access networks , 1997, Telecommun. Syst..

[9] Balaji Raghavachari,et al. Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design , 2004, TALG.

[10] Chung-Lun Li,et al. Analysis of heuristics for the design of tree networks , 1992, Ann. Oper. Res..

[11] Bezalel Gavish,et al. Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[12] D. West. Introduction to Graph Theory , 1995 .