A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
[article]
2018
arXiv
pre-print
In Maximum k-Vertex Cover (Max k-VC), the input is an edge-weighted graph G and an integer k, and the goal is to find a subset S of k vertices that maximizes the total weight of edges covered by S. Here we say that an edge is covered by S iff at least one of its endpoints lies in S. We present an FPT approximation scheme (FPT-AS) that runs in (1/ϵ)^O(k) poly(n) time for the problem, which improves upon Gupta et al.'s (k/ϵ)^O(k) poly(n)-time FPT-AS [SODA'18, FOCS'18]. Our algorithm is simple:
arXiv:1810.03792v1
fatcat:7bhcloorlvdejbv7vt56bdvrc4