The fast algorithm for online k-server problem on trees
From MaRDI portal
Publication:2097225
Cites work
- A data structure for dynamic trees
- A fast work function algorithm for solving the k-server problem
- A polylogarithmic-competitive algorithm for the k-server problem
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- An Optimal On-Line Algorithm for K Servers on Trees
- Classical and Quantum Computations with Restricted Memory
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Competitive analysis of maintaining frequent items of a stream
- Competitive snoopy caching
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- Fast Algorithms for Finding Nearest Common Ancestors
- Guide to competitive programming. Learning and improving algorithms through contests
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- Introduction to algorithms
- On r-gatherings on the line
- Online facility assignment
- Online Weighted Matching
- Quantum online algorithms with respect to space and advice complexity
- Quantum online streaming algorithms with logarithmic memory
- Recursive Star-Tree Parallel Data Structure
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- Two-way and one-way quantum and classical automata with advice for online minimization problems
Cited in
(4)
This page was built for publication: The fast algorithm for online \(k\)-server problem on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097225)
