Approximating the dense set-cover problem
- 1 December 2004
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 69 (4) , 547-561
- https://doi.org/10.1016/j.jcss.2004.03.006
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- On Some Approximation Algorithms for Dense Vertex Cover ProblemPublished by Springer Nature ,2000
- An approximation of the minimum vertex cover in a graphJapan Journal of Industrial and Applied Mathematics, 1999
- Approximating dense cases of covering problemsPublished by American Mathematical Society (AMS) ,1998
- Ramsey numbers and an approximation algorithm for the vertex cover problemActa Informatica, 1985
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975