Stable assignment with couples: parameterized complexity and local search (Q456691): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: College Admissions and the Stability of Marriage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard variants of stable marriage. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the “stable roommates” problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stable Roommates Problem with Ties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lattice Structure of the Set of Stable Matchings with Multiple Partners / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-complete stable matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable matchings and preferences of couples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of matchings when individuals have preferences over colleagues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keeping partners together: Algorithmic results for the hospitals/residents problem with couples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Losing Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized view on matroid optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with job assignment restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching with sizes (or scheduling with processing set restrictions) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on the stable matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank

Latest revision as of 19:13, 5 July 2024

scientific article
Language Label Description Also known as
English
Stable assignment with couples: parameterized complexity and local search
scientific article

    Statements

    Stable assignment with couples: parameterized complexity and local search (English)
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    0 references
    stable matching
    0 references
    couples
    0 references
    local search
    0 references
    parameterized complexity
    0 references
    scheduling with job restrictions
    0 references
    0 references