A Tight Analysis of the Greedy Algorithm for Set Cover

@article{Slavk1997ATA,
  title={A Tight Analysis of the Greedy Algorithm for Set Cover},
  author={Peter Slav{\'i}k},
  journal={J. Algorithms},
  year={1997},
  volume={25},
  pages={237-254}
}
Highly Cited
This paper has 507 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 201 extracted citations

Identifying Codes and Covering Problems

IEEE Transactions on Information Theory • 2008
View 9 Excerpts
Highly Influenced

An Algorithm for Approximating Set Cover and Its Application on Logic Circuit Optimization

2013 International Conference on Computer Sciences and Applications • 2013
View 3 Excerpts
Highly Influenced

Covering Analysis of the Greedy Algorithm for Partial Cover

Algorithms and Applications • 2010
View 9 Excerpts
Method Support
Highly Influenced

Reliable relay node placement in wireless sensor network

2008 Third International Conference on Communications and Networking in China • 2008
View 3 Excerpts
Highly Influenced

507 Citations

02040'96'01'07'13'19
Citations per Year
Semantic Scholar estimates that this publication has 507 citations based on the available data.

See our FAQ for additional information.