On conceptually simple algorithms for variants of online bipartite matching (Q5915658): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by one other user not shown)
description / endescription / en
scientific article; zbMATH DE number 6893224
scientific article; zbMATH DE number 7146022
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1429.91230 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/s00224-019-09916-0 / rank
 
Normal rank
Property / published in
 
Property / published in: Theory of Computing Systems / rank
 
Normal rank
Property / publication date
 
19 December 2019
Timestamp+2019-12-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 December 2019 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7146022 / rank
 
Normal rank
Property / zbMATH Keywords
 
conceptually simple algorithms
Property / zbMATH Keywords: conceptually simple algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
priority algorithms
Property / zbMATH Keywords: priority algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
bipartite matching
Property / zbMATH Keywords: bipartite matching / rank
 
Normal rank
Property / zbMATH Keywords
 
greedy algorithms
Property / zbMATH Keywords: greedy algorithms / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951971373 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized greedy matching. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Online Stochastic Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``Greedy matching: guarantees and limitations'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy matching: guarantees and limitations / 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: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sum coloring and sum multi-coloring for restricted families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Experimental Study of Algorithms for Online Bipartite Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Incremental) priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The advice complexity of a class of hard online problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Local Improvement and Weighted Set Packing Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of greedy algorithms for graph problems / 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: Linear-Time Approximation for Maximum Weight Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4606307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite matching in the semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Online Preemptive Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / 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: Q5743414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Weighted Matching: Improved Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online independent sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / 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: Better bounds for matchings in the streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with unknown distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Matching in Semi-streaming with Few Passes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of ordinary differential equations as limits of pure jump markov processes / 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: Graph sketching and streaming: new approaches for analyzing massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Greedy Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority algorithms for the subset-sum problem / rank
 
Normal rank

Latest revision as of 07:27, 21 July 2024

scientific article; zbMATH DE number 7146022
Language Label Description Also known as
English
On conceptually simple algorithms for variants of online bipartite matching
scientific article; zbMATH DE number 7146022

    Statements

    On conceptually simple algorithms for variants of online bipartite matching (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2018
    0 references
    19 December 2019
    0 references
    online bipartite matching
    0 references
    adversarial model
    0 references
    online IID model
    0 references
    priority model
    0 references
    category-advice algorithm
    0 references
    min greedy algorithm
    0 references
    conceptually simple algorithms
    0 references
    online algorithms
    0 references
    priority algorithms
    0 references
    bipartite matching
    0 references
    greedy algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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