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
.
New Tools and Connections for Exponential-time Approximation
[article]
2017
arXiv
pre-print
In this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and a parameter α>1, and the goal is to design an α-approximation algorithm with the fastest possible running time. We show the following results: - An r-approximation for maximum independent set in O^*((Õ(n/r ^2 r+r^2r))) time, - An r-approximation for chromatic number in O^*((Õ(n/r r+r^2r))) time, - A (2-1/r)-approximation for minimum vertex cover in
arXiv:1708.03515v1
fatcat:32ntmuwzhfd7dfkd4qv3orf45q