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, Yoshida-Honmachi, Sakyo-ku, Kyoto-shi, Kyoto 606-8501, Japan;Academic Center for Computing and Media Studies, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto-shi, Kyoto 606-8501, Japan;IBM Research - Tokyo, 1623-14 Shimotsuruma, Yamato-shi, Kanagawa 242-8502, Japan
Venue:
Journal of Discrete Algorithms
Year:
2012

Citing 7
Cited 0

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
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)
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
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.00

Visualization

Abstract

Manlove and O@?Malley (2008) [8] 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).