Matchings with lower quotas: algorithms and complexity = Alsó kvótás párosítások : algoritmusok és komplexitás

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 sets of co...

Full Description

Saved in:

Bibliographic Details

Authors and Corporations:	Arulselvan, Ashwin (Author), Cseh, Ágnes (Author), Groß, Martin (Author), Manlove, David F. (Author), Matuschke, Jannik (Author)
Other Authors:	Cseh, Ágnes (VerfasserIn) , Groß, Martin (VerfasserIn) , Manlove, David F. (VerfasserIn) 1974- , Matuschke, Jannik (VerfasserIn)
Type of Resource:	E-Book
Language:	English
published:	Budapest Institute of Economics, Centre for Economic and Regional Studies, Hungarian Academy of Sciences September 2017
Series:	Közgazdaságtudományi Intézet: Mu̐helytanulmányok ; MT-DP - 2017, 24
Source:	Verbunddaten SWB Lizenzfreie Online-Ressourcen
Notes:	Zusammenfassung in ungarischer Sprache
ISBN:	9786155457142 615545714X