Approximation Algorithms for Connected Dominating Sets (1996)

by Sudipto Guha , Samir Khuller
Venue:Algorithmica
Citations:305 - 9 self

Active Bibliography

Approximation Algorithms for Connected Dominating Sets – S. Guha, S. Khuller - 1998
Approximation Algorithms for Connected Dominating Sets – Sudipto Gupta, et al. - 1996
658 A Threshold of ln n for Approximating Set Cover – Uriel Feige - 1998
723 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
600 Automatic Subspace Clustering of High Dimensional Data – Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, Prabhakar Raghavan - 2005
1525 RADAR: an in-building RF-based user location and tracking system – Paramvir Bahl, Venkata N. Padmanabhan - 2000
818 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
585 Efficient Graph-Based Image Segmentation – Pedro F. Felzenszwalb, Daniel P. Huttenlocher
572 Pictorial Structures for Object Recognition – Pedro F. Felzenszwalb, Daniel P. Huttenlocher - 2003