scientific article; zbMATH DE number 6850371
From MaRDI portal
Publication:4607945
zbMATH Open1403.68360MaRDI QIDQ4607945FDOQ4607945
Authors: Ilan Reuven Cohen, David Wajc 
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175332
Title of this publication is not available (Why is that?)
Recommendations
- Online matching in regular bipartite graphs
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- Markovian online matching algorithms on large bipartite random graphs
- On randomized algorithms for matching in the online preemptive model
- Online stochastic matching: new algorithms and bounds
- scientific article; zbMATH DE number 1033855
- Online stochastic matching: new algorithms with better bounds
- Random matchings in regular graphs
- Online maximum matching with recourse
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Analysis of algorithms (68W40)
Cited In (17)
- Max-min greedy matching problem: hardness for the adversary and fractional variant
- Title not available (Why is that?)
- Improved bounds for randomized preemptive online matching
- Improved bounds for online preemptive matching
- On randomized algorithms for matching in the online preemptive model
- Online allocation and display ads optimization with surplus supply
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- Improved competitive ratio for edge-weighted online stochastic matching
- Stochastic online metric matching
- Online matching in regular bipartite graphs
- Online minimum matching with uniform metric and random arrivals
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- Markovian online matching algorithms on large bipartite random graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Max-min greedy matching problem: hardness for the adversary and fractional variant
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607945)
