Results 21 to 21 of about 43,407 (21)
On Advice Complexity of the k-server Problem under Sparse Metrics
, 2013 We consider the k-server problem under the advice model of computation when the underlying metric space is sparse. On one side, we show that an advice of size {\Omega}(n) is required to obtain a 1-competitive algorithm for sequences of size n, even for ...
Gupta, Sushmita +2 more
core +1 more source