A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
The Power of Amortized Recourse for Online Graph Problems
[article]
2022
arXiv
pre-print
In this work, we study online graph problems with monotone-sum objectives. We propose a general two-fold greedy algorithm that references yardstick algorithms to achieve t-competitiveness while incurring at most w_max·(t+1)/min{1, w_min}·(t-1) amortized recourse, where w_max and w_min are the largest value and the smallest positive value that can be assigned to an element in the sum. We further show that the general algorithm can be improved for three classical graph problems by carefully
arXiv:2206.01077v2
fatcat:s4nrq4kvljhthjl5dmxvckfjim