ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs

03/02/2020
by   Fedor V. Fomin, et al.
0

We present an algorithm for the extensively studied Long Path and Long Cycle problems on unit disk graphs that runs in time 2^O(√(k))(n+m). Under the Exponential Time Hypothesis, Long Path and Long Cycle on unit disk graphs cannot be solved in time 2^o(√(k))(n+m)^O(1) [de Berg et al., STOC 2018], hence our algorithm is optimal. Besides the 2^O(√(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 2^O(√(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)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2021

ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space

De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexp...
research
06/30/2021

Close relatives (of Feedback Vertex Set), revisited

At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a numb...
research
07/08/2021

Feedback Vertex Set on Geometric Intersection Graphs

In this paper, we present an algorithm for computing a feedback vertex s...
research
02/17/2022

An Optimal Algorithm for Product Structure in Planar Graphs

The Product Structure Theorem for planar graphs (Dujmović et al.JACM, 67...
research
07/24/2023

A faster and simpler algorithm for learning shallow networks

We revisit the well-studied problem of learning a linear combination of ...
research
02/06/2018

Resilient Blocks for Summarising Distributed Data

Summarising distributed data is a central routine for parallel programmi...
research
01/22/2021

On Optimization of 1/2-Approximation Path Cover Algorithm

In this paper, we propose a deterministic algorithm that approximates th...

Please sign up or login with your details

Forgot password? Click here to reset