Many-to-one Matchings with Lower Quotas: Algorithms and Complexity

DOI10.1007/978-3-662-48971-0_16zbMath1386.68114arXiv1412.0325OpenAlexW1630505549MaRDI QIDQ3459860

Ashwin Arulselvan, David F. Manlove, Martin Groß, Jannik Matuschke, Ágnes Cseh

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0325

zbMATH Keywords

maximum matchinginapproximabilitybounded treewidthmany-to-one matchingproject allocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Pareto optimal matchings with lower quotas

This page was built for publication: Many-to-one Matchings with Lower Quotas: Algorithms and Complexity