2026-07-25T01:47:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7393 2024-03-06T10:40:24Z ddc:004 open_access

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. Lokshtanov, Daniel Panolan, Fahad Saurabh, Saket Zehavi, Meirav Longest Cycle Cycle Packing Feedback Vertex Set Unit Disk Graph Parameterized Complexity We give algorithms with running time 2^{O({\sqrt{k}\log{k}})} n^{O(1)} for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains (i) a path on exactly/at least k vertices, (ii) a cycle on exactly k vertices, (iii) a cycle on at least k vertices, (iv) a feedback vertex set of size at most k, and (v) a set of k pairwise vertex disjoint cycles. For the first three problems, no subexponential time parameterized algorithms were previously known. For the remaining two problems, our algorithms significantly outperform the previously best known parameterized algorithms that run in time 2^{O(k^{0.75}\log{k})} n^{O(1)}. Our algorithms are based on a new kind of tree decompositions of unit disk graphs where the separators can have size up to k^{O(1)} and there exists a solution that crosses every separator at most O(\sqrt{k}) times. The running times of our algorithms are optimal up to the log{k} factor in the exponent, assuming the Exponential Time Hypothesis. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Fedor V. Fomin and Daniel Lokshtanov and Fahad Panolan and Saket Saurabh and Meirav Zehavi 2017 Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2017.65 urn:nbn:de:0030-drops-73937 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.65 eng https://creativecommons.org/licenses/by/3.0/legalcode