A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Improved non-approximability results for minimum vertex cover with density constraints
1999
Theoretical Computer Science
We provide new non-approximabili~ results for the restrictjons of the MIN VERTEX COVER problem to bounded-degree, sparse and dense graphs. We show that for a suthciently large 3, the recent 1.16 lower bound proved by H&ad (1997) extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we show a similar result but with a better trade-off between non-approximability and spars&y. Finally, we observe
doi:10.1016/s0304-3975(97)00226-0
fatcat:4o2gvwapxzgrjlg4w2jixvhv44