On the Covering Steiner Problem
暂无分享,去创建一个
[1] R. Ravi,et al. A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.
[2] Aravind Srinivasan,et al. New approaches to covering and packing problems , 2001, SODA '01.
[3] Svante Janson,et al. Poisson Approximation for Large Deviations , 1990, Random Struct. Algorithms.
[4] Guy Kortsarz,et al. On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem , 2002, SWAT.
[5] Robert Krauthgamer,et al. Polylogarithmic inapproximability , 2003, STOC '03.
[6] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[7] Aravind Srinivasan,et al. Approximation algorithms for the covering Steiner problem , 2002, Random Struct. Algorithms.
[8] Sudipto Guha,et al. Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[9] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[10] Aravind Srinivasan,et al. Integrality ratio for group Steiner trees and directed steiner trees , 2003, SODA '03.