Improved approximation bounds for the student-project allocation problem with preferences over projects (Q450528): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jda.2012.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055987334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for the student-project allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation results for the stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 25/17-Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better and simpler approximation algorithms for the stable marriage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Student-project allocation with preferences over projects / rank
 
Normal rank

Latest revision as of 17:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Improved approximation bounds for the student-project allocation problem with preferences over projects
scientific article

    Statements

    Improved approximation bounds for the student-project allocation problem with preferences over projects (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    the student project allocation problem
    0 references
    stable matching
    0 references
    NP-hardness
    0 references
    approximation algorithm
    0 references
    approximation ratio
    0 references
    0 references