Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6648 LNCS 440-451
DOI: 10.1007/978-3-642-20877-5_43
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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). © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Iwama, K., Miyazaki, S., & Yanagisawa, H. (2011). Improved approximation bounds for the student-project allocation problem with preferences over projects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6648 LNCS, pp. 440–451). https://doi.org/10.1007/978-3-642-20877-5_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free