An approximation algorithm for minimum-cost network design
暂无分享,去创建一个
[1] A. Kershenbaum,et al. A unified algorithm for designing multidrop teleprocessing networks , 1974, DATACOMM '73.
[2] R. Boorstyn,et al. Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..
[3] David Peleg,et al. An optimal synchronizer for the hypercube , 1987, PODC '87.
[4] R. Ravi,et al. When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.
[5] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[6] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[7] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[8] Ran Raz,et al. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.
[9] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.