pith. sign in

In all of the following cases, we make use of ∆ψ = √ 24D ε (∑k i=1d(a′ i,c′ i)−∑k i=1d(ai,ci) ) ≤ √ 24D ε ∑k i=1d(ci,c′ i)+ √ 24D ε (∑k i=1d(a′ i,c′ i)−∑k i=1d(ai,c′ i) )

We have d(a′ 1, c′ 1)− d(a1, c′ 1)≤ min(mc, 1 D(1−ε)·d(˜a,r′))

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.DS 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Managing Multiple Mobile Resources

cs.DS · 2019-07-23 · unverdicted · novelty 6.0

Proves impossibility of constant competitiveness for k-mobile servers without request locality, gives constant lower bounds with locality, and presents a polynomial-competitive algorithm via simulation of k-page migration plus greedy moves under augmentation and locality.

citing papers explorer

Showing 1 of 1 citing paper.

  • Managing Multiple Mobile Resources cs.DS · 2019-07-23 · unverdicted · none · ref 18

    Proves impossibility of constant competitiveness for k-mobile servers without request locality, gives constant lower bounds with locality, and presents a polynomial-competitive algorithm via simulation of k-page migration plus greedy moves under augmentation and locality.