Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
80 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs (2403.11426v1)

Published 18 Mar 2024 in cs.DS and cs.CG

Abstract: In this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows. 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. Our algorithm runs in time $2{O(\sqrt k)}n{O(1)}$. This improves the $2{O(\sqrt k\log k)}n{O(1)}$-time algorithm by Fomin et al. [SODA 2012, ICALP 2017]. Moreover, our algorithm is optimal assuming the exponential-time hypothesis.

PDF HTML Abstract
Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Bookmark Chat Bubble Oval Streamline Icon: https://streamlinehq.com Chat (Pro)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (32)
  1. Feedback Vertex Set on Geometric Intersection Graphs. In Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC 2021), pages 47:1–47:12, 2021.
  2. True contraction decomposition and almost eth-tight bipartization for unit-disk graphs. In 38th International Symposium on Computational Geometry (SoCG 2022), pages 11:1–11:16, 2022.
  3. Parameterized study of steiner tree on unit disk graphs. Algorithmica, 85:133–152, 2023.
  4. A linear kernel for the k𝑘kitalic_k-disjoint cycle problem on planar graphs. In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pages 306–317, 2008.
  5. Shortest paths in intersection graphs of unit disks. Computational Geometry, 48(4):360–367, 2015.
  6. Timothy M Chan. Finding triangles and other small subgraphs in geometric intersection graphs. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), pages 1777–1805, 2023.
  7. Approximate shortest paths and distance oracles in weighted unit-disk graphs. Journal of Computational Geometry, 10(2):3–20, 2019.
  8. Solving connectivity problems parameterized by treewidth in single exponential time. In Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), pages 150–159, 2011.
  9. A framework for Exponential-Time-Hypothesis–tight algorithms and lower bounds in geometric intersection graphs. SIAM Journal on Computing, 49(6):1291–1331, 2020.
  10. Hristo N Djidjev. Weighted graph separators and their applications. In Proceedings of the 5th Annual European Symposium on Algorithms (ESA 1997), pages 130–143, 1997.
  11. Catalan structures and dynamic programming in H𝐻Hitalic_H-minor-free graphs. Journal of Computer and System Sciences, 78(5):1606–1622, 2012.
  12. Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Algorithmica, 58(3):790–810, 2010.
  13. Fundamentals of parameterized complexity, volume 4. Springer, 2013.
  14. Distributed coloring and the local structure of unit-disk graphs. Theoretical Computer Science, 944:113674, 2023.
  15. ETH tight algorithms for geometric intersection graphs: Now in polynomial space. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), pages 21:1–21:16, 2021.
  16. Finding, hitting and packing cycles in subexponential time on unit disk graphs. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), pages 65:1–65:15, 2017.
  17. Decomposition of map graphs with applications. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), pages 60:1–60:15, 2019.
  18. ETH-tight algorithms for long path and cycle on unit disk graphs. In Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020), pages 44:1–44:18, 2020.
  19. Bidimensionality and geometric graphs. In Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pages 1563–1575, 2012.
  20. Approximability of packing disjoint cycles. Algorithmica, 60(2):395–400, 2011.
  21. A simple algorithm for computing a cycle separator. CoRR, abs/1709.08122, 2017.
  22. An approximation algorithm for maximum triangle packing. Discrete applied mathematics, 154(6):971–979, 2006.
  23. Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. Theoretical Computer Science, 932:13–20, 2022.
  24. Vertex-edge domination in unit disk graphs. Discrete Applied Mathematics, 319:351–361, 2022.
  25. Routing in unit disk graphs. Algorithmica, 80(3):830–848, 2018.
  26. Odd cycle packing. In Proceedings of the forty-second ACM symposium on Theory of computing (STOC 2010), pages 695–704, 2010.
  27. Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms, 3(4):48:1–48:21, 2007.
  28. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177–189, 1979.
  29. Applications of a planar separator theorem. SIAM Journal of Computing, 9(3):615–627, 1980.
  30. Packing cycles faster than Erdös–Pósa. SIAM Journal on Discrete Mathematics, 33(3):1194–1215, 2019.
  31. Subexponential parameterized algorithms on disk graphs. In 33rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2022), pages 2005–2031, 2022.
  32. Dániel Marx. Parameterized complexity of independence and domination on geometric graphs. In Proceedings of the 2nd International Conference on Parameterized and Exact Computation (IWPEC 2006), pages 154–165, 2006.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Shinwoo An (8 papers)
  2. Eunjin Oh (31 papers)
Citations (2)
View on Semantic Scholar
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets