The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
DOI10.1007/s00453-018-0514-6zbMath1421.68240OpenAlexW2778836939WikidataQ129219400 ScholiaQ129219400MaRDI QIDQ1741849
Elisabet Burjons, Dennis Komm, Marcel Schöngens
Publication date: 7 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-018-0514-6
sphereonline algorithmspositive curvatureadvice complexity\(k\)-server problem\(d\)-dimensional Euclidean space
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(k\)-server problem
- Online algorithms with advice for bin packing and scheduling problems
- On the advice complexity of the \(k\)-server problem under sparse metrics
- Online algorithms with advice: the tape model
- Online computation with advice
- Online algorithms. The state of the art
- Minimal discrete energy on the sphere
- On online algorithms with advice for the \(k\)-server problem
- Distributing many points on spheres: minimal energy and designs
- On the advice complexity of the \(k\)-server problem
- Improved analysis of the online set cover problem with advice
- The online knapsack problem: advice and randomization
- On point energies, separation radius and mesh norm for s-extremal configurations on compact sets in \(\mathbb R^n\)
- Weighted Online Problems with Advice
- On the Advice Complexity of the k-Server Problem
- On the Power of Randomness versus Advice in Online Computation
- Disjoint Path Allocation with Sublinear Advice
- New Ressults on Server Problems
- On the Additive Constant of the k-Server Work Function Algorithm
- Information Complexity of Online Problems
- Online Computation with Advice
- On the Advice Complexity of Online Problems
- On the k -server conjecture
- The k-Server Problem with Advice in d Dimensions and on the Sphere
- Online Makespan Scheduling with Sublinear Advice
- Advice Complexity and Barely Random Algorithms
- Measuring the problem-relevant information in input
- How Much Information about the Future Is Needed?
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem
This page was built for publication: The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
