English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We consider the generalized $k$-server problem on uniform metrics. We studythe power of memoryless algorithms and show tight bounds of $\Theta(k!)$ ontheir competitive ratio. In particular we show that the \textit{HarmonicAlgorithm} achieves this competitive ratio and provide matching lower bounds.This improves the $\approx 2^{2^k}$ doubly-exponential bound of Chiplunkar andVishwanathan for the more general setting of uniform metrics with differentweights.

Memoryless Algorithms for the Generalized $k$-server Problem on Uniform Metrics