ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs: Optimizing Cycle Packing Problem with Improved Algorithm
Core Concepts
Optimizing the Cycle Packing problem on unit disk graphs with an improved algorithm.
Abstract
The paper discusses the Cycle Packing problem on unit disk graphs, presenting an algorithm that aims to find a set of k vertex-disjoint cycles of G. It improves upon previous algorithms by running in 2O(√k)nO(1) time and is optimal under the exponential-time hypothesis. The study focuses on parameterized algorithms and approximation algorithms for various graph classes, particularly unit disk graphs. The content delves into geometric tools, surface decomposition, and weighted cycle separators for planar graphs.
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
Stats
Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of k vertex-disjoint cycles of G if it exists.
The algorithm runs in time 2O(√k)nO(1).
For planar graphs, a 2/3-balanced cycle separator can be computed with desired cycle-weight.
Quotes
"In this paper, we present an ETH-tight parameterized algorithm for the Cycle Packing problem on unit disk graphs." - Shinwoo An
"Our algorithm runs in time 2O(√k)nO(1) and is optimal assuming the exponential-time hypothesis." - Eunjin Oh