Pages that link to "Item:Q2292157"

The following pages link to A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157):

Displaying 10 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)
• A new approach to solve the \(k\)-server problem based on network flows and flow cost reduction (Q340306) (← links)
• On the additive constant of the \(k\)-server work function algorithm (Q1675878) (← links)
• On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093) (← links)
• The work function algorithm for the paging problem (Q2166767) (← links)
• The online \(k\)-server problem with rejection (Q2339820) (← links)
• (Q4520507) (← links)
• The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem (Q5419031) (← links)
• Managing multiple mobile resources (Q5919097) (← links)