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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 80; H. 1; S. 185 - 208
Hauptverfasser:	Arulselvan, Ashwin, Cseh, Ágnes, Groß, Martin, Manlove, David F., Matuschke, Jannik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2018 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!