A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem

DOI10.4230/LIPIcs.SEA.2018.8zbMath1496.90027arXiv1804.02731OpenAlexW2963240107MaRDI QIDQ5140716

David F. Manlove, Frances Cooper

Publication date: 16 December 2020

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

zbMATH Keywords

algorithmsstabilityapproximationmatching problems

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation algorithms (68W25) Matching models (91B68)

Related Items (1)

Super-stability in the student-project allocation problem with ties

Cites Work

• Two algorithms for the student-project allocation problem
• Student-project allocation with preferences over projects
• Hard variants of stable marriage.
• Linear time local approximation algorithm for maximum stable marriage
• Profile-Based Optimal Matchings in the Student/Project Allocation Problem
• Algorithmics of Matching Under Preferences

This page was built for publication: A 3 / 2 -approximation Algorithm for the Student-Project Allocation Problem