Matchings with lower quotas: algorithms and complexity
type: Item
instance of: scholarly article
title: Matchings with lower quotas: algorithms and complexity
zbMATH Open document ID: 1386.68115
author: Ashwin Arulselvan
author: Ágnes Cseh
author: Martin Groß
author: David F. Manlove
author: Jannik Matuschke
published in: Algorithmica
publication date: 2018-02-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6844601
zbMATH Keywords: maximum matching
zbMATH Keywords: many-to-one matching
zbMATH Keywords: project allocation
zbMATH Keywords: inapproximability
zbMATH Keywords: bounded treewidth
MaRDI profile type: Publication
full work available at URL: s00453-016-0252-6
OpenAlex ID: W2470524007
cites work: Two algorithms for the student-project allocation problem
cites work: Some APX-completeness results for cubic graphs
cites work: The college admissions problem with lower and common quotas
cites work: Q4291429
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Greedy local improvement and weighted set packing approximation
cites work: General factors of graphs
cites work: Q3138921
cites work: The hospitals/residents problem with lower quotas
cites work: Improved approximation bounds for the student-project allocation problem with preferences over projects
cites work: A note on the serial dictatorship with project closures
cites work: Cost minimization in wireless networks with a bounded and unbounded number of interfaces
cites work: Treewidth. Computations and approximations
cites work: Profile-Based Optimal Matchings in the Student/Project Allocation Problem
cites work: On the structure of factorizable graphs
cites work: Antifactors of graphs
cites work: Algorithmics of Matching Under Preferences
cites work: Student-project allocation with preferences over projects
cites work: Matching with quorums
cites work: Q5710169
cites work: Weighted Matching in Chess Tournaments
cites work: Graph factors and factorization: 1985--2003: a survey
cites work: Tractable cases of the extended global cardinality constraint
cites work: General antifactors of graphs
cites work: Q3012402
cites work: Q3002782
DOI: 10.1007/S00453-016-0252-6
description: scientific article; zbMATH DE number 6844601