Document Open Access Logo

Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion

Authors Daniel Mock , Peter Rossmanith

PDF
Thumbnail PDF

File

LIPIcs.SWAT.2024.35.pdf
  • Filesize: 0.85 MB
  • 18 pages

Document Identifiers

Author Details

Daniel Mock
  • RWTH Aachen University, Germany
Peter Rossmanith
  • RWTH Aachen University, Germany

Funding

Funded by the Deutsche Forschungsgemeinschaft (DFG, German Science Foundation) - RO {927/15-2}.

Cite AsGet BibTex

Daniel Mock and Peter Rossmanith. Solving a Family Of Multivariate Optimization and Decision Problems on Classes of Bounded Expansion. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 35:1-35:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SWAT.2024.35

Abstract

For some time, it has been known that the model checking problem for first-order formulas is fixed-parameter tractable on nowhere dense graph classes, so we shall ask in which direction there is space for improvements. One of the possible directions is to go beyond first-order formulas: Augmenting first-order logic with general counting quantifiers increases the expressiveness by far, but makes the model checking problem hard even on graphs of bounded tree-depth. The picture is different if we allow only "simple" - but arbitrarily nested - counting terms of the form #y φ(x^- ,y) > N. Even then, only approximate model checking is possible on graph classes of bounded expansion. Here, the largest known logic fragment, on which exact model checking is still fpt, consists of formulas of the form ∃x_1 … ∃x_k #y φ(x^- ,y) > N, where φ(x^- ,y) is a first-order formula without counting terms. An example of a problem that can be expressed in this way is partial dominating set: Are there k vertices that dominate at least a given number of vertices in the graph? The complexity of the same problem is open if you replace at least with exactly. Likewise, the complexity of "are there k vertices that dominate at least half of the blue and half of the red vertices?" is also open. We answer both questions by providing an fpt algorithm that solves the model checking problem for formulas of the more general form ψ ≡ ∃x_1 … ∃x_k P(#y φ_1(x^- ,y), …, #y φ_ℓ(x^- ,y)), where P is an arbitrary polynomially computable predicate on numbers. The running time is f(|ψ|)n^{𝓁+1} polylog(n) on graph classes of bounded expansion. Under SETH, this running time is tight up to almost linear factor.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
  • Theory of computation → Logic
  • Mathematics of computing → Graph algorithms
Keywords
  • bounded expansion
  • parameterized algorithms
  • sparsity
  • counting logic
  • dominating set
  • model checking
  • multivariate optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Amir Abboud, Karl Bringmann, Danny Hermelin, and Dvir Shabtay. SETH-based lower bounds for subset sum and bicriteria path. ACM Trans. Algorithms, 18(1):6:1-6:22, 2022. URL: https://doi.org/10.1145/3450524.
  2. B. Courcelle and M. Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science, 109(1):49-82, 1993. URL: https://doi.org/10.1016/0304-3975(93)90064-Z.
  3. Bruno Courcelle. The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf. Comput., 85(1):12-75, 1990. URL: https://doi.org/10.1016/0890-5401(90)90043-H.
  4. Bruno Courcelle, Johann A Makowsky, and Udi Rotics. Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, 33(2):125-150, 2000. Google Scholar
  5. Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-21275-3.
  6. Anuj Dawar, Martin Grohe, and Stephan Kreutzer. Locally excluding a minor. In 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pages 270-279. IEEE Computer Society, 2007. URL: https://doi.org/10.1109/LICS.2007.31.
  7. Jan Dreier, Nikolas Mählmann, and Sebastian Siebertz. First-order model checking on structurally sparse graph classes. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 567-580. ACM, 2023. URL: https://doi.org/10.1145/3564246.3585186.
  8. Jan Dreier, Daniel Mock, and Peter Rossmanith. Evaluating restricted first-order counting properties on nowhere dense classes and beyond. In 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, volume 274 of LIPIcs, pages 43:1-43:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.ESA.2023.43.
  9. Jan Dreier and Peter Rossmanith. Approximate evaluation of first-order counting queries. CoRR, abs/2010.14814, 2020. URL: https://doi.org/10.48550/arXiv.2010.14814.
  10. Jan Dreier and Peter Rossmanith. Approximate evaluation of first-order counting queries. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 1720-1739. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976465.104.
  11. Zdeněk Dvořák, Daniel Kráľ, and Robin Thomas. Deciding first-order properties for sparse graphs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA, pages 133-142. IEEE Computer Society, 2010. URL: https://doi.org/10.1109/FOCS.2010.20.
  12. Heinz-Dieter Ebbinghaus and Jörg Flum. Finite model theory. Perspectives in Mathematical Logic. Springer, 1995. Google Scholar
  13. Markus Frick and Martin Grohe. Deciding first-order properties of locally tree-decomposable structures. J. ACM, 48(6):1184-1206, 2001. URL: https://doi.org/10.1145/504794.504798.
  14. Robert Ganian, Petr Hliněný, Alexander Langer, Jan Obdržálek, Peter Rossmanith, and Somnath Sikdar. Lower bounds on the complexity of MSO_1 model-checking. J. Comput. Syst. Sci., 80(1):180-194, 2014. URL: https://doi.org/10.1016/j.jcss.2013.07.005.
  15. Mario Grobler, Yiting Jiang, Patrice Ossona de Mendez, Sebastian Siebertz, and Alexandre Vigny. Discrepancy and sparsity, 2021. URL: https://doi.org/10.48550/arXiv.2105.03693.
  16. Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Deciding first-order properties of nowhere dense graphs. J. ACM, 64(3):17:1-17:32, 2017. URL: https://doi.org/10.1145/3051095.
  17. Martin Grohe and Nicole Schweikardt. First-order query evaluation with cardinality conditions. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Houston, TX, USA, June 10-15, 2018, pages 253-266. ACM, 2018. URL: https://doi.org/10.1145/3196959.3196970.
  18. Wojciech Kazana and Luc Segoufin. First-order queries on classes of structures with bounded expansion. Log. Methods Comput. Sci., 16(1), 2020. URL: https://doi.org/10.23638/LMCS-16(1:25)2020.
  19. Joachim Kneis, Daniel Mölle, and Peter Rossmanith. Partial vs. complete domination: t-dominating set. In SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings, volume 4362 of Lecture Notes in Computer Science, pages 367-376. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-69507-3_31.
  20. Stephan Kreutzer and Siamak Tazari. Lower bounds for the complexity of monadic second-order logic. In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, 11-14 July 2010, Edinburgh, United Kingdom, pages 189-198. IEEE Computer Society, 2010. URL: https://doi.org/10.1109/LICS.2010.39.
  21. Dietrich Kuske and Nicole Schweikardt. First-order logic with counting. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, pages 1-12. IEEE Computer Society, 2017. URL: https://doi.org/10.1109/LICS.2017.8005133.
  22. Alexander Langer, Felix Reidl, Peter Rossmanith, and Somnath Sikdar. Practical algorithms for MSO model-checking on tree-decomposable graphs. Comput. Sci. Rev., 13-14:39-74, 2014. URL: https://doi.org/10.1016/j.cosrev.2014.08.001.
  23. Vasileios Nakos. Nearly optimal sparse polynomial multiplication. IEEE Trans. Inf. Theory, 66(11):7231-7236, 2020. URL: https://doi.org/10.1109/TIT.2020.2989385.
  24. Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity - Graphs, Structures, and Algorithms, volume 28 of Algorithms and combinatorics. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-27875-4.
  25. Jaroslav Nešetřil, Patrice Ossona de Mendez, and Sebastian Siebertz. Modulo-counting first-order logic on bounded expansion classes. Discrete Mathematics, page 113700, 2023. URL: https://doi.org/10.1016/j.disc.2023.113700.
  26. Detlef Seese. Linear time computable problems and first-order descriptions. Math. Struct. Comput. Sci., 6(6):505-526, 1996. URL: https://doi.org/10.1017/s0960129500070079.
  27. Szymon Toruńczyk. Aggregate queries on sparse databases. In Dan Suciu, Yufei Tao, and Zhewei Wei, editors, Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020, Portland, OR, USA, June 14-19, 2020, pages 427-443. ACM, 2020. URL: https://doi.org/10.1145/3375395.3387660.
  28. Joachim von zur Gathen and Jürgen Gerhard. Modern Computer Algebra (3. ed.). Cambridge University Press, 2013. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact