Pages that link to "Item:Q1854341"
From MaRDI portal
The following pages link to A randomized algorithm for two servers on the line. (Q1854341):
Displaying 17 items.
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- A fast work function algorithm for solving the \(k\)-server problem (Q300972) (← links)
- Knowledge state algorithms (Q548658) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- A tight lower bound for online convex optimization with switching costs (Q1644937) (← links)
- A \(k\)-median based online algorithm for the stochastic \(k\)-server problem (Q1644940) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- Sequencing two servers on a sphere (Q3217405) (← links)
- Randomized Competitive Analysis for Two-Server Problems (Q3541083) (← links)
- A randomized on–line algorithm for the <i>k</i>–server problem on a line (Q5486309) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)
