Matchings with Lower Quotas: Algorithms and Complexity

We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = ( A ∪ ˙ P , 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-to-one matching satisfying two s...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 80; no. 1; pp. 185 - 208
Main Authors:	Arulselvan, Ashwin, Cseh, Ágnes, Groß, Martin, Manlove, David F., Matuschke, Jannik
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2018 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Colleges & universities Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Matching Mathematics of Computing Polynomials Quotas Students Theory of Computation Maximum matching Bounded treewidth Many-to-one matching Inapproximability Project allocation
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!