Pages that link to "Item:Q5494971"

The following pages link to A Polylogarithmic-Competitive Algorithm for the k-Server Problem (Q5494971):

Displaying 16 items.

• R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
• A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
• The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
• The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
• Metrical service systems with multiple servers (Q2258084) (← links)
• On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
• Prioritized Metric Structures and Embedding (Q2941541) (← links)
• A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
• Serving Online Requests with Mobile Servers (Q3459911) (← links)
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation (Q5091239) (← links)
• Local embeddings of metric spaces (Q5919791) (← links)
• Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)
• The k-Server Problem with Delays on the Uniform Metric Space (Q6065471) (← links)
• Adversarial bandits with knapsacks (Q6551256) (← links)
• Deterministic 3-server on a circle and the limitation of canonical potentials (Q6634376) (← links)
• Time efficient implementation for online \(k\)-server problem on trees (Q6636094) (← links)