New Tools and Connections for Exponential-Time Approximation

@article{Bansal2018NewTA,
  title={New Tools and Connections for Exponential-Time Approximation},
  author={N. Bansal and Parinya Chalermsook and B. Laekhanukit and Danupon Nanongkai and Jesper Nederlof},
  journal={Algorithmica},
  year={2018},
  volume={81},
  pages={3993 - 4009}
}
AbstractIn this paper, we develop new tools and connections for exponential time approximation. In this setting, we are given a problem instance and an integer $$r>1$$r>1, and the goal is to design an approximation algorithm with the fastest possible running time. We give randomized algorithms that establish an approximation ratio of1.r for maximum independent set in $$O^*(\exp ({\tilde{O}}(n/r \log ^2 r+r\log ^2r)))$$O∗(exp(O~(n/rlog2r+rlog2r))) time,2.r for chromatic number in $$O^*(\exp… Expand
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Uniform Sparsest Cut and Related Problems
TLDR
The Sum-of-Squares hierarchy can be adapted to provide `fast', but still exponential time, approximation algorithms for several problems in the regime where they are believed to be NP-hard. Expand
Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems
We show that Set Cover on instances with $N$ elements cannot be approximated within $(1-\gamma)\ln N$-factor in time exp($N^{\gamma-\delta})$, for any $0 0$, assuming the Exponential Time Hypothesis.Expand
On subexponential running times for approximating directed Steiner tree and related problems
TLDR
Almost tight (super-polynomial) running times, for achieving desired approximation ratios for various problems, are proved by proving (1-d)ln n approximation algorithms for all these problems that run in time 2^{n^{d \log n } poly(m). Expand
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
TLDR
The Sum-of-Squares hierarchy can be adapted to provide "fast", but still exponential time, approximation algorithms for several problems in the regime where they are believed to be NP-hard. Expand
(In)approximability of Maximum Minimal FVS
TLDR
A generalization of the approximation algorithm is devised which, for any desired approximation ratio $r, produces an $r$-approximate solution in time $n^{O(n/r^{3/2})}$. Expand
On Finding Balanced Bicliques via Matchings
TLDR
The first approximation guarantees beyond brute-force are provided: an O(n/ log n) efficient approximation algorithm, and a parameterized approximation that returns, for any r ∈ N, an r-approximation algorithm in time exp ( O( n r log r ) ) . Expand
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
  • A. Kulik, H. Shachnai
  • Computer Science, Mathematics
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
  • 2020
TLDR
This paper shows an equivalence between the recurrence and a stochastic process, and introduces randomized branching as a tool for parameterized approximation and develops the mathematical machinery for its analysis. Expand
Promise Constraint Satisfaction and Width
TLDR
The main technical finding is that the template of every PCSP that is solvable in bounded width satisfies a certain structural condition implying that its algebraic closure-properties include weak near unanimity polymorphisms of all large arities. Expand
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
TLDR
This work surveys developments in the area of parameterization and approximation both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions. Expand

References

SHOWING 1-10 OF 45 REFERENCES
Time-approximation trade-offs for inapproximable problems
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 isExpand
Time-Approximation Trade-offs for Inapproximable Problems
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 isExpand
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
TLDR
Improved algorithms for finding small vertex covers in bounded degree graphs and hypergraphs are obtained and an approximation algorithm for the weighted independent set problem is obtained, matching a recent result of Halldorsson. Expand
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion
TLDR
It is shown that for any constant γ> 0, there is no polynomial time algorithm that approximates these problems within factor $n/2^{(\log n)^{3/4+\gamma}}$ in an n vertex graph, assuming ${\rm NP} \nsubseteq {\rm BPTIME}(2^{log n]^{O(1)}})$. Expand
Exact and approximate bandwidth
TLDR
Improvements in the field of exact and approximate exponential time algorithms for the Bandwidth problem are gathered and a technique based on the Fast Fourier Transform, parallel to the Fast Subset Convolution techniques introduced by Bjorklund et al. is developed. Expand
Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
TLDR
The Sum-of-Squares hierarchy can be adapted to provide "fast", but still exponential time, approximation algorithms for several problems in the regime where they are believed to be NP-hard. Expand
Exponential-time approximation of weighted set cover
TLDR
This work investigates whether the constant c can be made even smaller when one allows constant factor approximation, and describes a kind of approximation schemes-trade-offs between approximation factor and the time complexity. Expand
Exponential-Time Approximation of Hard Problems
TLDR
This work investigates whether the constant $c$ can be made even smaller when one allows constant factor approximation, and describes a kind of approximation schemes -- trade-offs between approximation factor and the time complexity. Expand
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
TLDR
A "reversal" of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems is presented and any NP-hardness of approximation result for MaxClique yields a proof system for NP. Expand
Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover
  • Irit Dinur
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2016
TLDR
It is shown that if gap-3SAT has no sub-exponential time algorithms then a weak form of the sliding scale conjecture holds, and that if there is a polynomial time algorithm for approximating the value of label cover to within a factor of approximation of no(1) then gap-2SAT (and thus, random- 3SAT) must have faster-than-exp exponential-time algorithms. Expand
...
1
2
3
4
5
...