Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints

Authors Tanmay Inamdar , Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, Anannya Upasana



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.88.pdf
  • Filesize: 0.9 MB
  • 18 pages

Document Identifiers

Author Details

Tanmay Inamdar
  • Indian Institute of Technology Jodhpur, India
Pallavi Jain
  • Indian Institute of Technology Jodhpur, India
Daniel Lokshtanov
  • University of California Santa Barbara, CA, USA
Abhishek Sahu
  • National Institute of Science, Education and Research Bhubaneswar, HBNI, India
Saket Saurabh
  • The Institute of Mathematical Sciences, HBNI, Chennai, India
  • University of Bergen, Norway
Anannya Upasana
  • The Institute of Mathematical Sciences, HBNI, Chennai, India

Cite AsGet BibTex

Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh, and Anannya Upasana. Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 88:1-88:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.88

Abstract

In the MaxSAT with Cardinality Constraint problem (CC-MaxSAT), we are given a CNF-formula Φ, and a positive integer k, and the goal is to find an assignment β with at most k variables set to true (also called a weight k-assignment) such that the number of clauses satisfied by β is maximized. Maximum Coverage can be seen as a special case of CC-MaxSat, where the formula Φ is monotone, i.e., does not contain any negative literals. CC-MaxSat and Maximum Coverage are extremely well-studied problems in the approximation algorithms as well as the parameterized complexity literature. Our first conceptual contribution is that CC-MaxSat and Maximum Coverage are equivalent to each other in the context of FPT-Approximation parameterized by k (here, the approximation is in terms of the number of clauses satisfied/elements covered). In particular, we give a randomized reduction from CC-MaxSat to Maximum Coverage running in time 𝒪(1/ε)^{k} ⋅ (m+n)^{𝒪(1)} that preserves the approximation guarantee up to a factor of (1-ε). Furthermore, this reduction also works in the presence of "fairness" constraints on the satisfied clauses, as well as matroid constraints on the set of variables that are assigned true. Here, the "fairness" constraints are modeled by partitioning the clauses of the formula Φ into r different colors, and the goal is to find an assignment that satisfies at least t_j clauses of each color 1 ≤ j ≤ r. Armed with this reduction, we focus on designing FPT-Approximation schemes (FPT-ASes) for Maximum Coverage and its generalizations. Our algorithms are based on a novel combination of a variety of ideas, including a carefully designed probability distribution that exploits sparse coverage functions. These algorithms substantially generalize the results in Jain et al. [SODA 2023] for CC-MaxSat and Maximum Coverage for K_{d,d}-free set systems (i.e., no d sets share d elements), as well as a recent FPT-AS for Matroid Constrained Maximum Coverage by Sellier [ESA 2023] for frequency-d set systems.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Partial Vertex Cover
  • Max SAT
  • FPT Approximation
  • Matroids

Metrics

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

References

  1. Omid Amini, Fedor V. Fomin, and Saket Saurabh. Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci., 77(6):1159-1171, 2011. URL: https://doi.org/10.1016/j.jcss.2010.12.002.
  2. Sayan Bandyapadhyay, Aritra Banik, and Sujoy Bhore. On colorful vertex and edge cover problems. Algorithmica, pages 1-12, 2023. Google Scholar
  3. Sayan Bandyapadhyay, Zachary Friggstad, and Ramin Mousavi. A parameterized approximation scheme for generalized partial vertex cover. In Pat Morin and Subhash Suri, editors, WADS 2023, pages 93-105, 2023. Google Scholar
  4. Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, and Sambuddha Roy. Approximation algorithms for the partition vertex cover problem. Theor. Comput. Sci., 555:2-8, 2014. URL: https://doi.org/10.1016/j.tcs.2014.04.006.
  5. Markus Bläser. Computing small partial coverings. Inf. Process. Lett., 85(6):327-331, 2003. URL: https://doi.org/10.1016/S0020-0190(02)00434-9.
  6. Gruia Călinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput., 40(6):1740-1766, 2011. URL: https://doi.org/10.1137/080733991.
  7. Chandra Chekuri, Tanmay Inamdar, Kent Quanrud, Kasturi R. Varadarajan, and Zhao Zhang. Algorithms for covering multiple submodular constraints and applications. J. Comb. Optim., 44(2):979-1010, 2022. URL: https://doi.org/10.1007/s10878-022-00874-x.
  8. Vincent Cohen-Addad, Anupam Gupta, Amit Kumar, Euiwoong Lee, and Jason Li. Tight FPT approximations for k-median and k-means. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi, editors, ICALP 2019, pages 42:1-42:14, 2019. Google Scholar
  9. M. Cygan, F. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  10. Uriel Feige. A threshold of ln n for approximating set cover (preliminary version). In Gary L. Miller, editor, STOCS, 1996, pages 314-318. ACM, 1996. URL: https://doi.org/10.1145/237814.237977.
  11. Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee, and Pasin Manurangsi. A survey on approximation in parameterized complexity: Hardness and algorithms. Algorithms, 13(6):146, 2020. URL: https://doi.org/10.3390/a13060146.
  12. F. V. Fomin, D. Lokshtanov, and S. Saurabh. Efficient computation of representative sets with applications in parameterized and exact algorithms. In proceedings of SODA, pages 142-151, 2014. Google Scholar
  13. Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. Subexponential algorithms for partial cover problems. Inf. Process. Lett., 111(16):814-818, 2011. URL: https://doi.org/10.1016/j.ipl.2011.05.016.
  14. Jiong Guo, Rolf Niedermeier, and Sebastian Wernicke. Parameterized complexity of vertex cover variants. Theory Comput. Syst., 41(3):501-520, 2007. URL: https://doi.org/10.1007/s00224-007-1309-3.
  15. Chien-Chung Huang and François Sellier. Matroid-constrained maximum vertex cover: Approximate kernels and streaming algorithms. In Artur Czumaj and Qin Xin, editors, SWAT 2022, pages 27:1-27:15, 2022. URL: https://doi.org/10.4230/LIPIcs.SWAT.2022.27.
  16. Eunpyeong Hung and Mong-Jen Kao. Approximation algorithm for vertex cover with multiple covering constraints. Algorithmica, 84(1):1-12, 2022. URL: https://doi.org/10.1007/s00453-021-00885-w.
  17. Pallavi Jain, Lawqueen Kanesh, Fahad Panolan, Souvik Saha, Abhishek Sahu, Saket Saurabh, and Anannya Upasana. Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 3713-3733. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch143.
  18. Tomohiro Koana, Christian Komusiewicz, André Nichterlein, and Frank Sommer. Covering many (or few) edges with k vertices in sparse graphs. In Petra Berenbrink and Benjamin Monmege, editors, STACS 2022, pages 42:1-42:18, 2022. URL: https://doi.org/10.4230/LIPIcs.STACS.2022.42.
  19. Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh. Lossy kernelization. In Hamed Hatami, Pierre McKenzie, and Valerie King, editors, STOC 2017, pages 224-237. ACM, 2017. URL: https://doi.org/10.1145/3055399.3055456.
  20. Pasin Manurangsi. A note on max k-vertex cover: Faster fpt-as, smaller approximate kernel and improved approximation. In Jeremy T. Fineman and Michael Mitzenmacher, editors, SOSA 2019, pages 15:1-15:21, 2019. Google Scholar
  21. Pasin Manurangsi. Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back. CoRR, abs/2403.06335, 2024. URL: https://doi.org/10.48550/ARXIV.2403.06335.
  22. Dániel Marx. A parameterized view on matroid optimization problems. In Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, and Stefan Szeider, editors, ACiD 2006, volume 7 of Texts in Algorithmics, page 158. King’s College, London, 2006. Google Scholar
  23. Dániel Marx. Parameterized complexity and approximation algorithms. Comput. J., 51(1):60-78, 2008. Google Scholar
  24. François Sellier. Parameterized matroid-constrained maximum coverage. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, ESA 2023, volume 274 of LIPIcs, pages 94:1-94:16, 2023. Google Scholar
  25. Piotr Skowron and Piotr Faliszewski. Chamberlin-courant rule with approval ballots: Approximating the maxcover problem with bounded frequencies in FPT time. J. Artif. Intell. Res., 60:687-716, 2017. URL: https://doi.org/10.1613/jair.5628.
  26. Maxim Sviridenko. Best possible approximation algorithm for MAX SAT with cardinality constraint. Algorithmica, 30(3):398-405, 2001. URL: https://doi.org/10.1007/s00453-001-0019-5.
  27. Laurence A. Wolsey. An analysis of the greedy algorithm for the submodular set covering problem. Comb., 2(4):385-393, 1982. URL: https://doi.org/10.1007/BF02579435.