On the advice complexity of online bipartite matching and online stable marriage (Q402379): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5365114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Coloring of Bipartite Graphs with and without Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the k-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative worst order ratio for online algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matching with concave returns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the problem-relevant information in input / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Set with Advice: The Impact of Graph Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Graph Exploration with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Advice Complexity of Buffer Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Computation with Advice / 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: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Advice Complexity of the k-server Problem under Sparse Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Complexity of Online Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with unknown distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: Online Actions Based on Offline Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank

Latest revision as of 23:33, 8 July 2024

scientific article
Language Label Description Also known as
English
On the advice complexity of online bipartite matching and online stable marriage
scientific article

    Statements

    On the advice complexity of online bipartite matching and online stable marriage (English)
    0 references
    0 references
    28 August 2014
    0 references
    online algorithms
    0 references
    advice complexity
    0 references
    bipartite matching
    0 references
    stable marriage
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references