Construct · 1 fields · 1 citations

k-server conjecture: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Algorithms

the conjecture that some deterministic online algorithm for moving k servers to requests in a metric space is k-competitive.

In algorithms, k-server conjecture refers to the conjecture that some deterministic online algorithm for moving k servers to requests in a metric space is k-competitive. This meaning comes from Manasse (1990) in Journal of Algorithms.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how k-server conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

metric4 fields · 4 citationsjingle · one word, four constructs

References

Manasse, M. S., McGeoch, L. A., & Sleator, D. D. (1990). Competitive algorithms for server problems. Journal of Algorithms, 11(2), 208-230. https://doi.org/10.1016/0196-6774(90)90003-w

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct