Eth-tight algorithms for long path and cycle on unit disk graphs

Fomin, F.V. and Lokshtanov, D. and Panolan, Fahad and et al, . (2020) Eth-tight algorithms for long path and cycle on unit disk graphs. In: 36th International Symposium on Computational Geometry, SoCG 2020, 23 June 2020through 26 June 2020, Zurich.

[img] Text
LIPIcs.pdf - Published Version
Available under License Creative Commons Attribution.

Download (698kB)


We present an algorithm for the extensively studied Long Path and Long Cycle problems on unit disk graphs that runs in time 2O(√k)(n + m). Under the Exponential Time Hypothesis, Long Path and Long Cycle on unit disk graphs cannot be solved in time 2o(√k)(n + m)O(1) [de Berg et al., STOC 2018], hence our algorithm is optimal. Besides the 2O(√k)(n + m)O(1)-time algorithm for the (arguably) much simpler Vertex Cover problem by de Berg et al. [STOC 2018] (which easily follows from the existence of a 2k-vertex kernel for the problem), this is the only known ETH-optimal fixed-parameter tractable algorithm on UDGs. Previously, Long Path and Long Cycle on unit disk graphs were only known to be solvable in time 2O(√k log k)(n + m). This algorithm involved the introduction of a new type of a tree decomposition, entailing the design of a very tedious dynamic programming procedure. Our algorithm is substantially simpler: we completely avoid the use of this new type of tree decomposition. Instead, we use a marking procedure to reduce the problem to (a weighted version of) itself on a standard tree decomposition of width O(√k). © Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi; licensed under Creative Commons License CC-BY 36th International Symposium on Computational Geometry (SoCG 2020).

[error in script]
IITH Creators:
IITH CreatorsORCiD
Panolan, Fahad
Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: ETH, Long Cycle, Long Path, Optimality Program, Parameterized Complexity, Unit Disk Graphs
Subjects: Computer science
Divisions: Department of Computer Science & Engineering
Depositing User: . LibTrainee 2021
Date Deposited: 02 Nov 2022 11:54
Last Modified: 02 Nov 2022 11:55
Publisher URL:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 11138 Statistics for this ePrint Item