Algorithms – ESA 2005
From MaRDI portal
Publication:5475877
DOI10.1007/11561071zbMath1151.68748MaRDI 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
Tight Bounds for Online Vector Scheduling, The Nonstochastic Multiarmed Bandit Problem, Crowdsourcing label quality: a theoretical analysis, Non-cooperative Cost Sharing Games Via Subsidies, Unnamed Item, Randomized algorithms for online knapsack problems, Non-cooperative cost sharing games via subsidies, A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs, Robust multicovers with budgeted uncertainty, Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost, Improved online algorithm for fractional knapsack in the random order model, Randomized Online Algorithms for Set Cover Leasing Problems