Document Open Access Logo

Diverse Collections in Matroids and Graphs

Authors Fedor V. Fomin , Petr A. Golovach , Fahad Panolan , Geevarghese Philip , Saket Saurabh



PDF
Thumbnail PDF

File

LIPIcs.STACS.2021.31.pdf
  • Filesize: 0.86 MB
  • 14 pages

Document Identifiers

Author Details

Fedor V. Fomin
  • University of Bergen, Norway
Petr A. Golovach
  • University of Bergen, Norway
Fahad Panolan
  • Department of Computer Science and Engineering, IIT Hyderabad, India
Geevarghese Philip
  • Chennai Mathematical Institute, India
  • UMI ReLaX, Chennai, India
Saket Saurabh
  • Institute of Mathematical Sciences, Chennai, India
  • University of Bergen, Norway

Cite AsGet BibTex

Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Geevarghese Philip, and Saket Saurabh. Diverse Collections in Matroids and Graphs. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.STACS.2021.31

Abstract

We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from graph theory. The input to the Weighted Diverse Bases problem consists of a matroid M, a weight function ω:E(M)→N, and integers k ≥ 1, d ≥ 0. The task is to decide if there is a collection of k bases B_1, ..., B_k of M such that the weight of the symmetric difference of any pair of these bases is at least d. This is a diverse variant of the classical matroid base packing problem. The input to the Weighted Diverse Common Independent Sets problem consists of two matroids M₁,M₂ defined on the same ground set E, a weight function ω:E→N, and integers k ≥ 1, d ≥ 0. The task is to decide if there is a collection of k common independent sets I_1, ..., I_k of M₁ and M₂ such that the weight of the symmetric difference of any pair of these sets is at least d. This is motivated by the classical weighted matroid intersection problem. The input to the Diverse Perfect Matchings problem consists of a graph G and integers k ≥ 1, d ≥ 0. The task is to decide if G contains k perfect matchings M_1, ..., M_k such that the symmetric difference of any two of these matchings is at least d. The underlying problem of finding one solution (basis, common independent set, or perfect matching) is known to be doable in polynomial time for each of these problems, and Diverse Perfect Matchings is known to be NP-hard for k = 2. We show that Weighted Diverse Bases and Weighted Diverse Common Independent Sets are both NP-hard. We show also that Diverse Perfect Matchings cannot be solved in polynomial time (unless P=NP) even for the case d = 1. We derive fixed-parameter tractable (FPT) algorithms for all three problems with (k,d) as the parameter. The above results on matroids are derived under the assumption that the input matroids are given as independence oracles. For Weighted Diverse Bases we present a polynomial-time algorithm that takes a representation of the input matroid over a finite field and computes a poly(k,d)-sized kernel for the problem.

Subject Classification

ACM Subject Classification
  • Theory of computation → Fixed parameter tractability
Keywords
  • Matroids
  • Diverse solutions
  • Fixed-parameter tractable algorithms

Metrics

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

References

  1. Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip, and Frances A. Rosamond. Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory, 2019. To appear at IJCAI 2020, URL: https://arxiv.org/abs/1903.07410.
  2. Julien Baste, Lars Jaffke, Tomáš Masařík, Geevarghese Philip, and Günter Rote. FPT algorithms for diverse collections of hitting sets. Algorithms, 12(12):254, 2019. Google Scholar
  3. Charles J. Colbourn, J. Scott Provan, and Dirk Vertigan. The complexity of computing the Tutte polynomial on transversal matroids. Combinatorica, 15(1):1-10, 1995. URL: https://doi.org/10.1007/BF01294456.
  4. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer Publishing Company, Incorporated, 1st edition, 2015. Google Scholar
  5. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013. URL: https://doi.org/10.1007/978-1-4471-5559-1.
  6. Jack Edmonds. Lehman’s switching game and a theorem of tutte and nash-williams. J. Res. Nat. Bur. Standards Sect. B, 69:73-77, 1965. Google Scholar
  7. Jack Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969), pages 69-87. Gordon and Breach, New York, 1970. Google Scholar
  8. Jack Edmonds. Matroids and the greedy algorithm. Math. Program., 1(1):127-136, 1971. URL: https://doi.org/10.1007/BF01584082.
  9. Michael Ralph Fellows. The diverse X paradigm. Manuscript, November 2018. Google Scholar
  10. Fedor V. Fomin, Petr A. Golovach, Lars Jaffke, Geevarghese Philip, and Danil Sagunov. Diverse pairs of matchings. CoRR, abs/2009.04567, 2020. URL: http://arxiv.org/abs/2009.04567.
  11. Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, 2019. URL: https://doi.org/10.1017/9781107415157.
  12. András Frank. A weighted matroid intersection algorithm. J. Algorithms, 2(4):328-336, 1981. URL: https://doi.org/10.1016/0196-6774(81)90032-8.
  13. M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google Scholar
  14. Omer Giménez and Marc Noy. On the complexity of computing the Tutte polynomial of bicircular matroids. Combin. Probab. Comput., 15(3):385-395, 2006. URL: https://doi.org/10.1017/S0963548305007327.
  15. Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, and Yota Otachi. Finding diverse trees, paths, and more, 2020. arXiv preprint. URL: http://arxiv.org/abs/2009.03687.
  16. Ian Holyer. The NP-completeness of edge-coloring. SIAM Journal on computing, 10(4):718-720, 1981. Google Scholar
  17. James G. Oxley. Matroid theory. Oxford University Press, 1992. Google Scholar
  18. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency, volume 24. Springer Science & Business Media, 2003. Google Scholar
  19. Leslie G Valiant. The complexity of computing the permanent. Theoretical computer science, 8(2):189-201, 1979. Google Scholar
  20. Dirk Vertigan. Bicycle dimension and special points of the Tutte polynomial. J. Combin. Theory Ser. B, 74(2):378-396, 1998. URL: https://doi.org/10.1006/jctb.1998.1860.
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