The fast algorithm for online \(k\)-server problem on trees
From MaRDI portal
Publication:2097225
DOI10.1007/978-3-031-09574-0_12OpenAlexW4285195015MaRDI QIDQ2097225
Maxim Yagafarov, Kamil Khadiev
Publication date: 11 November 2022
Full work available at URL: https://arxiv.org/abs/2006.00605
Cites Work
- Unnamed Item
- Unnamed Item
- A fast work function algorithm for solving the \(k\)-server problem
- Competitive analysis of maintaining frequent items of a stream
- Quantum online algorithms with respect to space and advice complexity
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- Competitive snoopy caching
- Guide to competitive programming. Learning and improving algorithms through contests
- A data structure for dynamic trees
- Two-way and one-way quantum and classical automata with advice for online minimization problems
- Quantum online streaming algorithms with logarithmic memory
- The Frequent Items Problem in Online Streaming Under Various Performance Measures
- A Polylogarithmic-Competitive Algorithm for the k -Server Problem
- An Optimal On-Line Algorithm for K Servers on Trees
- Fast Algorithms for Finding Nearest Common Ancestors
- On r-Gatherings on the Line
- Competitive Analysis of Aggregate Max in Windowed Streaming
- Recursive Star-Tree Parallel Data Structure
- Online Weighted Matching
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem
- Online facility assignment
- Classical and Quantum Computations with Restricted Memory
This page was built for publication: The fast algorithm for online \(k\)-server problem on trees
