Improved approximation bounds for the student-project allocation problem with preferences over projects

Authors:
Kazuo Iwama;Shuichi Miyazaki;Hiroki Yanagisawa
Affiliations:
Graduate School of Informatics, Kyoto University;Academic Center for Computing and Media Studies, Kyoto University;IBM Research - Tokyo
Venue:
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Year:
2011

Citing 7
Cited 0

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Hard variants of stable marriage

Theoretical Computer Science
Two algorithms for the Student-Project Allocation problem

Journal of Discrete Algorithms
Improved approximation results for the stable marriage problem

ACM Transactions on Algorithms (TALG)
Student-Project Allocation with preferences over Projects

Journal of Discrete Algorithms
A 25/17-approximation algorithm for the stable marriage problem with one-sided ties

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Better and Simpler Approximation Algorithms for the Stable Marriage Problem

Algorithmica - Special Issue: European Symposium on Algorithms

Quantified Score

Hi-index	0.02

Visualization

Abstract

Manlove and O'Malley [9] proposed the Student-Project Allocation Problem with Preferences over Projects (SPA-P). They proved that the problem of finding a maximum stable matching in SPA-P is APX-hard and gave a polynomial-time 2-approximation algorithm. In this paper, we give an improved upper bound of 1.5 and a lower bound of 21/19 ( 1.1052).