scientific article; zbMATH DE number 6846408
From MaRDI portal
Publication:4606307
DOI10.4230/LIPIcs.ESA.2016.37zbMath1397.68231arXiv1602.07154MaRDI QIDQ4606307
Marc P. Renault, Christian Konrad, Christoph Dürr
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1602.07154
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (10)
An Experimental Study of Algorithms for Online Bipartite Matching ⋮ Advice complexity of online non-crossing matching ⋮ Temporal matching on geometric graph data ⋮ 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 ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Advice complexity of priority algorithms ⋮ Temporal matching ⋮ Online bin covering with advice ⋮ Weighted Online Problems with Advice
This page was built for publication: