Author:
Guha Sudipto,Khuller Samir
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Berman, P., Ramaiyer, V.: Improved approximation algorithms for the Steiner tree problem. J. Algorithms 17, 381–408 (1994)
2. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32, 171–176 (1989)
3. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1989)
4. Feige, U.: A threshold of ln n for approximating set-cover. In: 28th ACM Symposium on Theory of Computing, pp. 314–318 (1996)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1978)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Coverage;Connected Dominating Set: Theory and Applications;2012-09-11
2. Weighted CDS in Unit Disk Graph;Connected Dominating Set: Theory and Applications;2012-09-11
3. CDS in Unit Ball Graphs and Growth Bounded Graphs;Connected Dominating Set: Theory and Applications;2012-09-11
4. CDS in Unit Disk Graph;Connected Dominating Set: Theory and Applications;2012-09-11
5. CDS in General Graph;Connected Dominating Set: Theory and Applications;2012-09-11