Pages that link to "Item:Q4369887"

The following pages link to On the <i>k</i> -server conjecture (Q4369887):

Displaying 50 items.

• A simple analysis of the harmonic algorithm for two servers (Q294802) (← links)
• The \(k\)-server problem (Q458484) (← links)
• A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• Online computation with advice (Q541670) (← links)
• A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
• On the remote server problem or more about TCP acknowledgments (Q861268) (← links)
• The minimum backlog problem (Q888427) (← links)
• Randomized algorithm for the \(k\)-server problem on decomposable spaces (Q1044025) (← links)
• A note on the server problem and a benevolent adversary (Q1178219) (← links)
• The 2-evader problem (Q1351604) (← links)
• More on randomized on-line algorithms for caching. (Q1401208) (← links)
• Competitive analysis of randomized paging algorithms (Q1575677) (← links)
• \(k\)-server problems with bulk requests: an application to tool switching in manufacturing (Q1593540) (← links)
• Trackless online algorithms for the server problem (Q1607049) (← links)
• Randomized competitive analysis for two server problems (Q1662430) (← links)
• On the additive constant of the \(k\)-server work function algorithm (Q1675878) (← links)
• A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
• The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
• The \(k\)-server problem with advice in \(d\) dimensions and on the sphere (Q1741849) (← links)
• Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
• The \(k\)-resource problem in uniform metric spaces (Q1758162) (← links)
• Online matching on a line (Q1770389) (← links)
• On list update and work function algorithms. (Q1853486) (← links)
• The 3-server problem in the plane. (Q1853532) (← links)
• A randomized algorithm for two servers on the line. (Q1854341) (← links)
• A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
• The weighted 2-server problem (Q1887090) (← links)
• On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093) (← links)
• The CNN problem and other \(k\)-server variants (Q1887095) (← links)
• Nested convex bodies are chaseable (Q1987239) (← links)
• The traveling \(k\)-median problem: approximating optimal network coverage (Q2085738) (← links)
• Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
• Efficient algorithms for ride-hitching in UAV travelling (Q2166742) (← links)
• The work function algorithm for the paging problem (Q2166767) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• Reallocating multiple facilities on the line (Q2222090) (← links)
• Metrical service systems with multiple servers (Q2258084) (← links)
• A new upper bound on the work function algorithm for the \(k\)-server problem (Q2292157) (← links)
• Greedy metric minimum online matchings with random arrivals (Q2294274) (← links)
• Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
• The online \(k\)-server problem with rejection (Q2339820) (← links)
• Asymptotically optimal online page migration on three points (Q2350908) (← links)
• On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
• A \(o(n)\)-competitive deterministic algorithm for online matching on a line (Q2415368) (← links)
• Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
• A \(k\)-server problem with parallel requests and unit distances (Q2446066) (← links)
• Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
• A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)