A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Time-approximation trade-offs for inapproximable problems
2018
Journal of computer and system sciences (Print)
In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential. We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any r(n), a simple, known scheme gives an approximation ratio of r in time roughly r n/r . We show that, for most values of r, if this running
doi:10.1016/j.jcss.2017.09.009
fatcat:owftfddbcvejvlsb72epihnxfq