scientific article; zbMATH DE number 7559093
From MaRDI portal
Publication:5090428
DOI10.4230/LIPIcs.ITCS.2019.50MaRDI QIDQ5090428
Zoya Svitkina, Aaron Schild, Erik Vee, Ravi Kumar, Manish Purohit
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1812.00134
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-on-line bin packing: a short overview and a new lower bound
- Semi-online scheduling revisited
- Online stochastic reservation systems
- Competitive randomized algorithms for nonuniform problems
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- An optimal deterministic algorithm for online \(b\)-matching
- Maximum matching in the online batch-arrival model
- Bayesian Mechanism Design
- Online Optimization with Uncertain Information
- Dependent rounding and its applications to approximation algorithms
- On the Advice Complexity of Online Problems
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
This page was built for publication: