Pages that link to "Item:Q300972"

The following pages link to A fast work function algorithm for solving the \(k\)-server problem (Q300972):

Displaying 12 items.

• A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem (Q301952) (← links)
• A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction (Q340306) (← links)
• The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
• The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
• The work function algorithm for the paging problem (Q2166767) (← 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)
• An application of various algorithms for solving the \(k\)-server problem (Q2758242) (← links)
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem (Q5419031) (← links)
• Managing multiple mobile resources (Q5919097) (← links)
• Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
• Time efficient implementation for online \(k\)-server problem on trees (Q6636094) (← links)