A combinatorial metrical task system problem under the uniform metric
DOI10.1007/978-3-319-46379-7_19zbMATH Open1478.68453OpenAlexW2522942356MaRDI QIDQ2831385FDOQ2831385
Takumi Nakazono, Ken-Ichiro Moridomi, Kohei Hatano, Eiji Takimoto
Publication date: 9 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2324/1932327
Recommendations
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)
Cites Work
- A decision-theoretic generalization of on-line learning and an application to boosting
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Title not available (Why is that?)
- Efficient algorithms for online decision problems
- Combinatorial bandits
- An optimal on-line algorithm for metrical task system
- On the k -server conjecture
- 10.1162/1532443041424328
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Title not available (Why is that?)
- Randomized algorithms for metrical task systems
- Changing Bases: Multistage Optimization for Matroids and Matchings
- Title not available (Why is that?)
- A Polylogarithmic-Competitive Algorithm for the k -Server Problem
- A Regularization Approach to Metrical Task Systems
- Unified algorithms for online learning and competitive analysis
- Bandit Online Optimization over the Permutahedron
Cited In (2)
Uses Software
This page was built for publication: A combinatorial metrical task system problem under the uniform metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831385)
