We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
International audienceWhile randomized online algorithms have access to a sequence of uniform random bits, deterministiconline algorithms with advice have access to a sequence of {\em advice bits}, i.e., bits that are setby an all-powerful oracle prior to the processing of the request sequence.Advice bits are at least as helpful as random bits, but how helpful are they? In this work, we investigate thepower of advice bits and random bits for online maximum bipartite matching (\textsc{MBM}).The well-known Karp-Vazirani-Vazirani algorithm \cite{kvv90} is an optimalrandomized (1−e1)-competitive algorithm for \textsc{MBM} that requires access toΘ(nlogn) uniform random bits. We show that Ω(log(ϵ1)n) advicebits are necessary and O(ϵ51n) sufficient in order to obtain a(1−ϵ)-competitive deterministic advice algorithm. Furthermore,for a large natural class of deterministic advice algorithms, we prove thatΩ(logloglogn) advice bits are required in order to improve on the 21-competitiveness ofthe best deterministic online algorithm, while it is known that O(logn)bits are sufficient \cite{bkkk11}.Last, we give a randomized online algorithm that uses cn random bits, for integers c≥1,and a competitive ratio that approaches 1−e1 very quickly as c is increasing.For example if c=10, then the difference between 1−e1 and the achieved competitive ratiois less than 0.0002
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.