Papers
Topics
Authors
Recent
Search
2000 character limit reached

Packing Short Cycles

Published 24 Oct 2024 in cs.DS | (2410.18878v2)

Abstract: Cycle packing is a fundamental problem in optimization, graph theory, and algorithms. Motivated by recent advancements in finding vertex-disjoint paths between a specified set of vertices that either minimize the total length of the paths [Bj\"orklund, Husfeldt, ICALP 2014; Mari, Mukherjee, Pilipczuk, and Sankowski, SODA 2024] or request the paths to be shortest [Lochet, SODA 2021], we consider the following cycle packing problems: Min-Sum Cycle Packing and Shortest Cycle Packing. In Min-Sum Cycle Packing, we try to find, in a weighted undirected graph, $k$ vertex-disjoint cycles of minimum total weight. Our first main result is an algorithm that, for any fixed $k$, solves the problem in polynomial time. We complement this result by establishing the W[1]-hardness of Min-Sum Cycle Packing parameterized by $k$. The same results hold for the version of the problem where the task is to find $k$ edge-disjoint cycles. Our second main result concerns Shortest Cycle Packing, which is a special case of Min-Sum Cycle Packing that asks to find a packing of $k$ shortest cycles in a graph. We prove this problem to be fixed-parameter tractable (FPT) when parameterized by $k$ on weighted planar graphs. We also obtain a polynomial kernel for the edge-disjoint variant of the problem on planar graphs. Deciding whether Min-Sum Cycle Packing is FPT on planar graphs and whether Shortest Cycle Packing is FPT on general graphs remain challenging open questions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. Every planar map is four colorable. American Mathematical Society, 1989.
  2. Using a geometric lens to find k𝑘kitalic_k-disjoint shortest paths. SIAM Journal on Discrete Mathematics, 37(3):1674–1703, 2023.
  3. Interval scheduling and colorful independent sets. Journal of Scheduling, 18(5):449–469, 2015.
  4. Shortest two disjoint paths in polynomial time. SIAM Journal on Computing, 48(6):1698–1710, 2019.
  5. Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science, 412(35):4570–4578, 2011.
  6. (Meta) kernelization. Journal of the ACM, 63(5):44:1–44:69, 2016.
  7. Towards single face shortest vertex-disjoint paths in undirected planar graphs. In Proceedings of the 23rd Annual European Symposium Algorithms (ESA), pages 227–238. Springer, 2015.
  8. Random separation: A new method for solving fixed-cardinality optimization problems. In Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC), pages 239–250. Springer, 2006.
  9. Zhi-Zhong Chen. Approximation algorithms for independent sets in map graphs. Journal of Algorithms, 41(1):20–40, 2001.
  10. Map graphs. Journal of the ACM, 49(2):127–138, 2002.
  11. Éric Colin De Verdière and Alexander Schrijver. Shortest vertex-disjoint two-face paths in planar graphs. ACM Transactions on Algorithms, 7(2):1–12, 2011.
  12. Parameterized Algorithms. Springer, 2015.
  13. Shortest k𝑘kitalic_k-disjoint paths via determinants. In Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 19:1–19:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
  14. Reinhard Diestel. Graph Theory. Springer, 2012.
  15. Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.
  16. Fundamentals of Parameterized Complexity. Springer, 2013.
  17. Tali Eilam-Tzoreff. The disjoint shortest paths problem. Discrete Applied Mathematics, 85(2):113–138, 1998.
  18. A combinatorial problem in geometry. Compositio mathematica, 2:463–470, 1935.
  19. Polynomial kernels for weighted problems. Journal of Computer System Sciences, 84:1–10, 2017.
  20. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM, 63(4):29:1–29:60, 2016.
  21. Bidimensionality and kernels. SIAM Journal on Computing, 49(6):1397–1422, 2020.
  22. An application of simultaneous diophantine approximation in combinatorial optimization. Combinatorica, 7(1):49–65, 1987.
  23. Computers and intractability. W.H. Freeman and Company, 1979.
  24. Primal-dual approximation algorithms for feedback problems in planar graphs. Combinatorica, 18(1):37–59, 1998.
  25. The vertex-disjoint triangles problem. In Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pages 26–37. Springer, 1998.
  26. The all-pairs min cut problem and the minimum cycle basis problem on planar graphs. SIAM Journal on Discrete Mathematics, 7(3):403–418, 1994.
  27. Ian Holyer. The NP-completeness of some edge-partition problems. SIAM Journal on Computing, 10(4):713–717, 1981.
  28. Efficient planarity testing. Journal of the ACM, 21(4):549–568, 1974.
  29. A new approach to the minimum cut problem. Journal of the ACM, 43(4):601–640, 1996.
  30. One-face shortest disjoint paths with a deviation terminal. In Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC), pages 47:1–47:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.
  31. William Lochet. A polynomial time algorithm for the k𝑘kitalic_k-disjoint shortest paths problem. In Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 169–178. SIAM, 2021.
  32. Shortest disjoint paths on a grid. In Proceedings of 35th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 346–365. SIAM, 2024.
  33. On packing shortest cycles in graphs. Information Processing Letters, 109(14):816–821, 2009.
  34. The four-colour theorem. Journal of Combinatorial Theory, Series B, 70(1):2–44, 1997.
  35. Niklas Schlomberg. An improved integrality gap for disjoint cycles in planar graphs. In Proceeding of the 51st International Colloquium on Automata, Languages, and Programming (ICALP), pages 122:1–122:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
  36. Packing cycles in planar and bounded-genus graphs. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2069–2086. SIAM, 2023.
  37. Craig A. Tovey. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics, 8(1):85–89, 1984.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up