scientific article; zbMATH DE number 6297685
From MaRDI portal
Publication:5417601
zbMath1288.68101MaRDI QIDQ5417601
Yuval Rabani, Noa Avigdor-Elgrabli
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (7)
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs ⋮ Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities ⋮ Logarithmic price of buffer downscaling on line metrics ⋮ A note on sorting buffers offline ⋮ NP-hardness of the sorting buffer problem on the uniform metric ⋮ Reordering buffer management with advice ⋮ Tight Bounds for Online Coloring of Basic Graph Classes
This page was built for publication: