(2022) Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
|
Text
LIPIcs-ESA-2022-50.pdf Download (950kB) | Preview |
Abstract
We generalize the monotone local search approach of Fomin, Gaspers, Lokshtanov and Saurabh [J.ACM 2019], by establishing a connection between parameterized approximation and exponential-time approximation algorithms for {\em monotone subset minimization} problems. In a {\em monotone subset minimization} problem the input implicitly describes a non-empty set family over a universe of size $n$ which is closed under taking supersets. The task is to find a minimum cardinality set in this family. Broadly speaking, we use {\em approximate monotone local search} to show that a parameterized $\alpha$-approximation algorithm that runs in $c^k \cdot n^{\OO(1)}$ time, where $k$ is the solution size, can be used to derive an $\alpha$-approximation randomized algorithm that runs in $d^n \cdot n^{\OO(1)}$ time, where $d$ is the unique value in $d\in \left (1, 1+\frac{c-1}{\alpha} \right)$ such that $\D{\frac{1}{\alpha}}{\frac{d-1}{c-1}} =\frac{\ln c }{\alpha}$ and $\D{a}{b}$ is the Kullback-Leibler divergence. This running time matches that of Fomin et al.\ for $\alpha=1$, and is strictly better when $\alpha >1$, for any $c >1$. Furthermore, we also show that this result can be derandomized at the expense of a sub-exponential multiplicative factor in the running time. We use an approximate variant of the exhaustive search as a benchmark for our algorithm. We show that the classic $2^n \cdot n^{\OO(1)}$ exhaustive search can be adapted to an $\alpha$-approximate exhaustive search that runs in time $\left ( 1+ \exp\left (-\alpha \cdot \entropy\left (\frac{1}{\alpha}\right)\right)\right)^n \cdot n^{\OO(1)}$, where $\entropy$ is the entropy function. Furthermore, we provide a lower bound stating that the running time of this $\alpha$-approximate exhaustive search is the best achievable running time in an oracle model. When compared to approximate exhaustive search, and to other techniques, the running times obtained by approximate monotone local search are strictly better for any $\alpha \geq 1,~c >1$. We demonstrate the potential of approximate monotone local search by deriving new and faster exponential approximation algorithms for {\sc Vertex Cover}, {\sc $3$-Hitting Set}, {\sc Directed Feedback Vertex Set}, {\sc Directed Subset Feedback Vertex Set}, {\sc Directed Odd Cycle Transversal} and {\sc Undirected Multicut}. For instance, we get a $1.1$-approximation algorithm for {\sc Vertex Cover} with running time $1.114^n \cdot n^{\OO(1)}$, improving upon the previously best known $1.1$-approximation running in time $1.127^n \cdot n^{\OO(1)}$ by Bourgeois et al.\ [DAM 2011].
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Divisions: | Dániel Marx (DM) |
| Conference: | ESA European Symposium on Algorithms |
| Depositing User: | Ariel Kulik |
| Date Deposited: | 14 Oct 2022 12:34 |
| Last Modified: | 14 Oct 2022 12:34 |
| Primary Research Area: | NRA1: Trustworthy Information Processing |
| URI: | https://publications.cispa.saarland/id/eprint/3846 |
Actions
Actions (login required)
 |
View Item |