License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2022.50
URN: urn:nbn:de:0030-drops-158601
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15860/
Nederlof, Jesper ;
Pilipczuk, Michał ;
Swennenhuis, Céline M. F. ;
Węgrzycki, Karol
Isolation Schemes for Problems on Decomposable Graphs
Abstract
The Isolation Lemma of Mulmuley, Vazirani and Vazirani [Combinatorica'87] provides a self-reduction scheme that allows one to assume that a given instance of a problem has a unique solution, provided a solution exists at all. Since its introduction, much effort has been dedicated towards derandomization of the Isolation Lemma for specific classes of problems. So far, the focus was mainly on problems solvable in polynomial time.
In this paper, we study a setting that is more typical for NP-complete problems, and obtain partial derandomizations in the form of significantly decreasing the number of required random bits. In particular, motivated by the advances in parameterized algorithms, we focus on problems on decomposable graphs. For example, for the problem of detecting a Hamiltonian cycle, we build upon the rank-based approach from [Bodlaender et al., Inf. Comput.'15] and design isolation schemes that use
- ?(tlog n + log²{n}) random bits on graphs of treewidth at most t;
- ?(√n) random bits on planar or H-minor free graphs; and
- ?(n)-random bits on general graphs. In all these schemes, the weights are bounded exponentially in the number of random bits used. As a corollary, for every fixed H we obtain an algorithm for detecting a Hamiltonian cycle in an H-minor-free graph that runs in deterministic time 2^{?(√n)} and uses polynomial space; this is the first algorithm to achieve such complexity guarantees. For problems of more local nature, such as finding an independent set of maximum size, we obtain isolation schemes on graphs of treedepth at most d that use ?(d) random bits and assign polynomially-bounded weights.
We also complement our findings with several unconditional and conditional lower bounds, which show that many of the results cannot be significantly improved.
BibTeX - Entry
@InProceedings{nederlof_et_al:LIPIcs.STACS.2022.50,
author = {Nederlof, Jesper and Pilipczuk, Micha{\l} and Swennenhuis, C\'{e}line M. F. and W\k{e}grzycki, Karol},
title = {{Isolation Schemes for Problems on Decomposable Graphs}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-222-8},
ISSN = {1868-8969},
year = {2022},
volume = {219},
editor = {Berenbrink, Petra and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15860},
URN = {urn:nbn:de:0030-drops-158601},
doi = {10.4230/LIPIcs.STACS.2022.50},
annote = {Keywords: Isolation Lemma, Derandomization, Hamiltonian Cycle, Exact Algorithms}
}
|
Keywords: |
|
Isolation Lemma, Derandomization, Hamiltonian Cycle, Exact Algorithms |
|
Collection: |
|
39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
09.03.2022 |
