On Some Approximation Algorithms for Dense Vertex Cover Problem
- 1 January 2000
- conference paper
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Free bits, PCPs and non-approximability-towards tight resultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- Improved non-approximability results for vertex cover with density constraintsPublished by Springer Nature ,1996
- Polynomial time approximation schemes for dense instances of NP-hard problemsPublished by Association for Computing Machinery (ACM) ,1995
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981