Pages that link to "Item:Q1887093"

The following pages link to On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093):

Displaying 17 items.

• A fast work function algorithm for solving the \(k\)-server problem (Q300972) (← links)
• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem (Q301952) (← links)
• The \(k\)-server problem (Q458484) (← links)
• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
• Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
• Nested convex bodies are chaseable (Q1987239) (← links)
• The work function algorithm for the paging problem (Q2166767) (← links)
• Reallocating multiple facilities on the line (Q2222090) (← links)
• A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157) (← links)
• Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
• The online \(k\)-server problem with rejection (Q2339820) (← links)
• The online \(k\)-server problem with max-distance objective (Q2344003) (← links)
• On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
• Dynamic pricing of servers on trees (Q5875461) (← links)
• Managing multiple mobile resources (Q5919097) (← links)
• Online facility assignment (Q5919330) (← links)