Pages that link to "Item:Q3204037"

The following pages link to An Optimal On-Line Algorithm for <i>K</i> Servers on Trees (Q3204037):

Displaying 50 items.

• A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
• The \(k\)-server problem (Q458484) (← links)
• On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
• A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
• Geometric two-server algorithms (Q673915) (← links)
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
• The minimum backlog problem (Q888427) (← links)
• R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
• A note on the server problem and a benevolent adversary (Q1178219) (← links)
• On-line algorithms for locating checkpoints (Q1312186) (← links)
• Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
• A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
• Competitive \(k\)-server algorithms (Q1329151) (← links)
• The list update problem and the retrieval of sets (Q1331955) (← links)
• Competitive algorithms for the weighted server problem (Q1331957) (← 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)
• Trackless online algorithms for the server problem (Q1607049) (← links)
• Randomized competitive analysis for two server problems (Q1662430) (← 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)
• The \(k\)-resource problem in uniform metric spaces (Q1758162) (← 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)
• The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
• Metrical service systems with multiple servers (Q2258084) (← links)
• Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
• The online \(k\)-server problem with max-distance objective (Q2344003) (← links)
• Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
• A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
• On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
• Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
• (Q4010307) (← links)
• The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees (Q4575805) (← links)
• Multi-Finger Binary Search Trees (Q5091047) (← links)
• A Randomized Algorithm for Two Servers in Cross Polytope Spaces (Q5443387) (← links)
• ON THE k-TRUCK SCHEDULING PROBLEM (Q5696969) (← links)
• (Q5874496) (← links)
• Dynamic pricing of servers on trees (Q5875461) (← links)
• Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5918418) (← links)
• Online facility assignment (Q5919330) (← links)
• Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5925636) (← links)
• On page migration and other relaxed task systems (Q5958713) (← 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)