Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Beating ratio 0.5 for weighted oblivious matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized greedy matching. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized greedy matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matroid intersection: beating half for random arrival / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with unknown distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of continuous linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise kidney exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Duality Theorem for a Class of Continuous Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm / rank
 
Normal rank

Latest revision as of 10:43, 16 July 2024

scientific article; zbMATH DE number 6921486
Language Label Description Also known as
English
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming
scientific article; zbMATH DE number 6921486

    Statements

    Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    oblivious matching problem
    0 references
    continuous linear programming
    0 references
    ranking algorithm
    0 references
    0 references