Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Set cover problem
OpenAlex ID:
C100808899
A threshold of ln n for approximating set cover
1998
·
Uriel Feige
·
Journal of the ACM
·
3,844
PDF
A Greedy Heuristic for the Set-Covering Problem
1979
·
V. Chvatal
·
Mathematics of Operations Research
·
2,982
The Location of Emergency Service Facilities
1971
·
Constantine Toregas
, Ralph Swain
, et al.
·
Operations Research
·
2,131
A probabilistic heuristic for a computationally difficult set covering problem
1989
·
Thomas A Feo
, Mauricio G.C Resende
·
Operations Research Letters
·
1,314
A Best Possible Heuristic for the k-Center Problem
1985
·
Dorit S. Hochbaum
, David B. Shmoys
·
Mathematics of Operations Research
·
1,176
Energy-efficient target coverage in wireless sensor networks
2005
·
M. Cardei
, M.T. Thai
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
1,059
Greedy Strikes Back: Improved Facility Location Algorithms
1999
·
Sudipto Guha
, Samir Khuller
·
Journal of Algorithms
·
770
A genetic algorithm for the set covering problem
1996
·
J.E Beasley
, P.C Chu
·
European Journal of Operational Research
·
763
Approximation Algorithms for the Set Covering and Vertex Cover Problems
1982
·
Dorit S. Hochbaum
·
SIAM Journal on Computing
·
585
Accelerated greedy algorithms for maximizing submodular set functions
2005
·
Michel Minoux
·
Springer eBooks
·
556
Almost optimal set covers in finite VC-dimension
1995
·
H. Brönnimann
, M. T. Goodrich
·
Discrete & Computational Geometry
·
553
PDF
A Genetic Algorithm for the Set Covering Problem
1996
·
K. S. Al-Sultan
, M. F. Hussain
, et al.
·
Journal of the Operational Research Society
·
552
Algorithms for the Set Covering Problem
2000
·
Alberto Caprara
, Paolo Toth
, et al.
·
Annals of Operations Research
·
528
Vertex Cover: Further Observations and Further Improvements
2001
·
Jianer Chen
, Iyad A. Kanj
, et al.
·
Journal of Algorithms
·
516
The Maximum Availability Location Problem
1989
·
Charles ReVelle
, Kathleen Hogan
·
Transportation Science
·
495
A linear-time approximation algorithm for the weighted vertex cover problem
1981
·
R Bar-Yehuda
, S Even
·
Journal of Algorithms
·
486
Covering models and optimization techniques for emergency response facility location and planning: a review
2011
·
Xueping Li
, Zhaoxia Zhao
, et al.
·
Mathematical Methods of Operations Research
·
446
A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment
1981
·
Mark S. Daskin
, Edmund H. Stern
·
Transportation Science
·
444
Degrees of freedom in lasso problems
2012
·
Ryan J. Tibshirani
, Jonathan Taylor
·
The Annals of Statistics
·
427
PDF
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
2004
·
Zoë Abrams
, Ashish Goel
, et al.
·
ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN)
·
385
PDF
Minimal Controllability Problems
2014
·
Alex Olshevsky
·
IEEE Transactions on Control of Network Systems
·
361
PDF
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
2003
·
Fabián A. Chudak
, David B. Shmoys
·
SIAM Journal on Computing
·
356
Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems
1996
·
Dorit S. Hochbaum
·
PWS Publishing Co. eBooks
·
353
Strong computational lower bounds via parameterized complexity
2006
·
Jianer Chen
, Xiuzhen Huang
, et al.
·
Journal of Computer and System Sciences
·
347
Sparse partitions
2002
·
B. Awerbuch
, D. Peleg
·
Annual Symposium on Foundations of Computer Science
·
339
Show more works
View as search
Works count:
4,511
Citation count:
79,610
Year
Topic
Type