Improved algorithmic results for unsplittable stable allocation problems
From MaRDI portal
Publication:326457
DOI10.1007/s10878-015-9889-3zbMath1353.90077arXiv1411.6818OpenAlexW1967375242MaRDI QIDQ326457
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6818
Cites Work
- Unnamed Item
- Unnamed Item
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Some remarks on the stable matching problem
- On the single-source unsplittable flow problem
- A PTAS for the multiple subset sum problem with different knapsack capacities
- Faster algorithms for stable allocation problems
- Deferred acceptance algorithms: history, theory, practice, and open questions
- MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY
- On Stable Matchings and Flows
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- The Stable Allocation (or Ordinal Transportation) Problem
- College Admissions and the Stability of Marriage
This page was built for publication: Improved algorithmic results for unsplittable stable allocation problems