An Experimental Study of Algorithms for Online Bipartite Matching (Q6039931): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved Bounds for Online Stochastic Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Stable Instances Easy? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Bipartite Matching in Random Type Poisson Arrival Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conceptually simple algorithms for variants of online bipartite matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / 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: Q4606307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: Beating 1-1/e / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent rounding and its applications to approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Matching: New Algorithms with Better Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic initialization for bipartite matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / 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: Bayesian Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random graph models of social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extensions of the deterministic online model for bipartite matching and max-sat / rank
 
Normal rank

Latest revision as of 04:34, 1 August 2024

scientific article; zbMATH DE number 7688311
Language Label Description Also known as
English
An Experimental Study of Algorithms for Online Bipartite Matching
scientific article; zbMATH DE number 7688311

    Statements

    An Experimental Study of Algorithms for Online Bipartite Matching (English)
    0 references
    0 references
    0 references
    23 May 2023
    0 references
    bipartite graphs
    0 references
    bipartite matching
    0 references
    greedy algorithms
    0 references
    stochastic input models
    0 references

    Identifiers

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