Algorithms – ESA 2005
From MaRDI portal
Publication:5475877
DOI10.1007/11561071zbMath1151.68748OpenAlexW2501059503MaRDI QIDQ5475877
Joseph (Seffi) Naor, Niv Buchbinder
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Related Items (12)
The Nonstochastic Multiarmed Bandit Problem ⋮ Crowdsourcing label quality: a theoretical analysis ⋮ Randomized Online Algorithms for Set Cover Leasing Problems ⋮ A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Tight Bounds for Online Vector Scheduling ⋮ Randomized algorithms for online knapsack problems ⋮ Robust multicovers with budgeted uncertainty ⋮ Non-cooperative cost sharing games via subsidies ⋮ Non-cooperative Cost Sharing Games Via Subsidies ⋮ Improved online algorithm for fractional knapsack in the random order model ⋮ Unnamed Item
This page was built for publication: Algorithms – ESA 2005
