scientific article; zbMATH DE number 6846408
From MaRDI portal
Publication:4606307
DOI10.4230/LIPICS.ESA.2016.37zbMATH Open1397.68231arXiv1602.07154MaRDI QIDQ4606307FDOQ4606307
Christoph Dürr, Marc P. Renault, Christian Konrad
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1602.07154
Title of this publication is not available (Why is that?)
Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (12)
- A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
- On extensions of the deterministic online model for bipartite matching and max-sat
- Fully Online Matching with Advice on General Bipartite Graphs and Paths
- Temporal matching
- Weighted Online Problems with Advice
- Advice complexity of priority algorithms
- Online bin covering with advice
- An Experimental Study of Algorithms for Online Bipartite Matching
- Advice complexity of online non-crossing matching
- Temporal matching on geometric graph data
- The power of multiple choices in online stochastic matching
- On conceptually simple algorithms for variants of online bipartite matching
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 Q4606307)
