[PDF][PDF] Random walks on weighted graphs and applications to on-line algorithms
D Coppersmith, P Doyle, P Raghavan… - Journal of the ACM (JACM …, 1993 - dl.acm.org
D Coppersmith, P Doyle, P Raghavan, M Snir
Journal of the ACM (JACM), 1993•dl.acm.orgThe design and analysis of randomized on-line algorithms are studied. This problem is
shown to be closely related to the synthesis of random wdlks on graphs with positive real
costs on their edges. A theory is developed for the synthesis of such wdlks, and it is
employed to design competitive on-line algorithms.
shown to be closely related to the synthesis of random wdlks on graphs with positive real
costs on their edges. A theory is developed for the synthesis of such wdlks, and it is
employed to design competitive on-line algorithms.
Abstract
The design and analysis of randomized on-line algorithms are studied. This problem is shown to be closely related to the synthesis of random wdlks on graphs with positive real costs on their edges. A theory is developed for the synthesis of such wdlks, and it is employed to design competitive on-line algorithms.