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.
To Another Language
from source content
arxiv.org
Key Insights Distilled From
by Shinwoo An,E... at arxiv.org 03-19-2024
https://arxiv.org/pdf/2403.11426.pdfDeeper Inquiries