Faster algorithms for stable allocation problems (Q1959735): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-010-9416-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058018786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: The Stable Allocation (or Ordinal Transportation) Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithm for an optimal stable assignment with multiple partners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integral stable allocation problem on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data / 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: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995616 / 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: Every finite distributive lattice is a set of stable matchings for a small stable marriage instance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a complete stable matching / rank
 
Normal rank

Latest revision as of 07:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Faster algorithms for stable allocation problems
scientific article

    Statements

    Faster algorithms for stable allocation problems (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    stable allocation
    0 references
    stable marriage
    0 references
    stable matching
    0 references
    0 references