Given two admission control algorithms that are  c A  -accept-competitive and  c R  -reject-competitive respectively, we give two ways to make an algorithm that is simultaneously  O ( c A  )-accept-competitive and  O ( c A   c R  )-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  c A   or  c R  . This improves on work of Azar, Blum, and Mansour, whose combined algorithm was  O ( c 2  A  )-accept-competitive, involved computing offline optimal solutions, and required knowing the values of both  c A   and  c R  .
['David P. Bunde', 'Yishay Mansour']
Improved combination of online algorithms for acceptance and rejection