Improved combination of online algorithms for acceptance and rejection

Authors:
David P. Bunde;Yishay Mansour
Affiliations:
University of Illinois at Urbana-Champaign, Urbana, IL;Tel-Aviv University, Tel-Aviv, Israel
Venue:
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Year:
2004

Citing 1
Cited 1

Combining online algorithms for rejection and acceptance

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Admission control to minimize rejections and online set cover with repetitions

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given two admission control algorithms that are cA-accept-competitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)-accept-competitive and O(cAcR)-reject-competitive. The combined algorithms make no reference to the offline optimal solution. In addition, one of the algorithms does not require knowing the value of either cA or cR. This improves on work of Azar, Blum, and Mansour, whose combined algorithm was O(c2A)-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both cA and cR.