Many-to-one matchings with lower quotas : algorithms and complexity

Tools

Arulselvan, Ashwin and Cseh, Ágnes and Groß, Martin and Manlove, David F. and Matuschke, Jannik; (2015) Many-to-one matchings with lower quotas : algorithms and complexity. In: Algorithms and Computation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9472 . Springer-Verlag, JPN, pp. 176-187. ISBN 9783662489703 (https://doi.org/10.1007/978-3-662-48971-0_16)

[thumbnail of Arulselvan-etal-LNCS2015-many-to-one-matchings-with-lower-quotas-algorithms-and-complexity]
Preview
 Text. Filename: Arulselvan_etal_LNCS2015_many_to_one_matchings_with_lower_quotas_algorithms_and_complexity.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (232kB)| Preview

Abstract

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (AUP,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P. We seek a maximum weight many-toone matching satisfying two sets of constraints: vertices in A are incident to at most one matching edge, while vertices in P are either unmatched or they are incident to a number of matching edges between their lower and upper quota. This problem, which we call maximum weight many-toone matching with lower and upper quotas (wmlq), has applications to the assignment of students to projects within university courses, where there are constraints on the minimum and maximum numbers of students that must be assigned to each project. In this paper, we provide a comprehensive analysis of the complexity of wmlq from the viewpoints of classic polynomial time algorithms, fixed-parameter tractability, as well as approximability. We draw the line between NP-hard and polynomially tractable instances in terms of degree and quota constraints and provide efficient algorithms to solve the tractable ones. We further show that the problem can be solved in polynomial time for instances with bounded treewidth; however, the corresponding runtime is exponential in the treewidth with the maximum upper quota umax as basis, and we prove that this dependence is necessary unless FPT = W[1]. Finally, we also present an approximation algorithm for the general case with performance guarantee umax+1, which is asymptotically best possible unless P = NP.

ORCID iDs

Arulselvan, Ashwin ORCID logoORCID: https://orcid.org/0000-0001-9772-5523, Cseh, Ágnes, Groß, Martin, Manlove, David F. and Matuschke, Jannik;
CORE (COnnecting REpositories)