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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 80; číslo 1; s. 185 - 208
Hlavní autori:	Arulselvan, Ashwin, Cseh, Ágnes, Groß, Martin, Manlove, David F., Matuschke, Jannik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2018 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!