On subexponential running times for approximating directed Steiner tree and related problems
arXiv: Data Structures and Algorithms, Volume abs/1811.00710, 2018.
This paper concerns proving almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems. To illustrate, the question we study, let us consider the Set-Cover problem with n elements and m sets. Now we specify our goal to approximate Set-Cover to a factor of (1-d)ln n, for a given parameter...More
Full Text (Upload PDF)
PPT (Upload PPT)