Admission control to minimize rejections and online set cover with repetitions

DOI10.1145/1644015.1644026zbMath1300.68008OpenAlexW2084729404MaRDI QIDQ2930285

Shai Gutner, Noga Alon, Yossi Azar

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.5739

zbMATH Keywords

admission controlcompetitiveonline set cover

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (6)

Towards the price of leasing online ⋮ Randomized Online Algorithms for Set Cover Leasing Problems ⋮ Online set multicover algorithms for dynamic D2D communications ⋮ Towards flexible demands in online leasing problems ⋮ Approximating the online set multicover problems via randomized winnowing ⋮ Approximation algorithms for the ring loading problem with penalty cost

This page was built for publication: Admission control to minimize rejections and online set cover with repetitions