Approximation Algorithms for Connected Dominating Sets
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Carla D. Savage,et al. Depth-First Search and the Vertex Cover Problem , 1982, Inf. Process. Lett..
[3] Martin Farber,et al. Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.
[4] B. M. Waxman. New Approximation Algorithms for the Steiner Tree Problem , 1989 .
[5] V. Rich. Personal communication , 1989, Nature.
[6] Esther M. Arkin,et al. Approximating the Tree and Tour Covers of a Graph , 1993, Inf. Process. Lett..
[7] Carsten Lund,et al. On the hardness of approximating minimization problems , 1994, JACM.
[8] R. Ravi,et al. A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.
[9] Joseph S. B. Mitchell,et al. Approximation algorithms for geometric tour and network design problems (extended abstract) , 1995, SCG '95.
[10] Sanjoy Paul,et al. Locating faults in a systematic manner in a large heterogeneous network , 1995, Proceedings of INFOCOM'95.
[11] R. Ravi,et al. Service-Constrained Network Design Problems , 1996, Nord. J. Comput..
[12] F. Harary,et al. The e-mail gossip number and the connected domination number☆ , 1997 .
[13] Peter Slavík. A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.
[14] U. Feige. A threshold of ln n for approximating set cover , 1998, JACM.