Online algorithms and changing past decisions
-
04-11-2019 - |
문제
We know that for some online problems, algorithms can decrease their competitive ratio greatly if they are allowed to change some of their past decisions (see http://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.35).
I wonder if there are instances of online problems such that the competitive ratio does not decrease even if the algorithm is allowed to change its decisions ?
올바른 솔루션이 없습니다
제휴하지 않습니다 cs.stackexchange