DeepAI
Log In Sign Up

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

08/12/2020
by   Marek Cygan, et al.
0

We show that Set Cover on instances with N elements cannot be approximated within (1-γ)ln N-factor in time exp(N^γ-δ), for any 0 < γ < 1 and any δ > 0, assuming the Exponential Time Hypothesis. This essentially matches the best upper bound known by Cygan et al. (IPL, 2009) of (1-γ)ln N-factor in time exp(O(N^γ)). The lower bound is obtained by extracting a standalone reduction from Label Cover to Set Cover from the work of Moshkovitz (Theory of Computing, 2015), and applying it to a different PCP theorem than done there. We also obtain a tighter lower bound when conditioning on the Projection Games Conjecture. We also treat three problems (Directed Steiner Tree, Submodular Cover, and Connected Polymatroid) that strictly generalize Set Cover. We give a (1-γ)ln N-approximation algorithm for these problems that runs in exp(Õ(N^γ)) time, for any 1/2 ≤γ < 1.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/02/2018

On subexponential running times for approximating directed Steiner tree and related problems

This paper concerns proving almost tight (super-polynomial) running time...
11/21/2017

Revisiting the Set Cover Conjecture

In the Set Cover problem, the input is a ground set of n elements and a ...
02/10/2019

Set Cover in Sub-linear Time

We study the classic set cover problem from the perspective of sub-linea...
11/15/2021

A Chronology of Set Cover Inapproximability Results

It is well-known that an algorithm exists which approximates the NP-comp...
02/01/2021

A Tight Bound for Stochastic Submodular Cover

We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) ...
08/16/2022

Direct Sum Theorems From Fortification

We revisit the direct sum theorems in communication complexity which ask...
03/13/2018

Nearly Optimal Time Bounds for kPath in Hypergraphs

In the kPath problem the input is a graph G and an integer k, and the go...