An optimal on-line algorithm for metrical task system
From MaRDI portal
Recommendations
- On algorithm design for metrical task systems
- scientific article; zbMATH DE number 910899
- On-line learning and the metrical task system problem
- Randomized algorithms for metrical task systems
- Randomized algorithms for metrical task systems
- scientific article; zbMATH DE number 1559591
- A regularization approach to metrical task systems
- Parametrized Metrical Task Systems
- A new measure for the study of on-line algorithms
- On multi-threaded metrical task systems
Cited in
(86)- Randomized algorithms for metrical task systems
- Unfair problems and randomized algorithms for metrical task systems
- On the power of randomization in on-line algorithms
- Randomized competitive algorithms for the list update problem
- Competitive randomized algorithms for nonuniform problems
- A deterministic O(k^ 3)-competitive k-server algorithm for the circle
- Competitive algorithms for the weighted server problem
- The complexity of mean payoff games on graphs
- On algorithm design for metrical task systems
- On-line learning and the metrical task system problem
- On the competitiveness of the move-to-front rule
- Optimal online algorithms for an electronic commerce money distribution system
- The K-server problem via a modern optimization lens
- On randomization in on-line computation.
- Delayed information and action in on-line algorithms
- A general decomposition theorem for the k-server problem
- On-line generalized Steiner problem
- The CNN problem and other k-server variants
- Nested convex bodies are chaseable
- The traveling \(k\)-median problem: approximating optimal network coverage
- Randomized online computation with high probability guarantees
- Competitive clustering of stochastic communication patterns on a ring
- Paging with request sets
- Exploiting problem structure in optimization under uncertainty via online convex optimization
- The online \(k\)-server problem with rejection
- On online algorithms with advice for the k-server problem
- Uniform metrical task systems with a limited number of states
- Competitive analysis for the on-line truck transportation problem
- Ramsey-type theorems for metric spaces with applications to online problems
- How to whack moles
- Topology matters: smoothed competitiveness of metrical task systems
- Unified algorithms for online learning and competitive analysis
- A combinatorial metrical task system problem under the uniform metric
- An improved lower bound for load balancing of tasks with unknown duration
- Hyperbolic Dovetailing
- Competitive Algorithms for Layered Graph Traversal
- scientific article; zbMATH DE number 1305445 (Why is no real title available?)
- Nearly Optimal Competitive Online Replacement Policies
- The \(k\)-server problem
- Handling critical jobs online: deadline scheduling and convex-body chasing
- scientific article; zbMATH DE number 910899 (Why is no real title available?)
- A regularization approach to metrical task systems
- Metrical task systems on trees via mirror descent and unfair gluing
- Randomized online multi-threaded paging
- Randomized algorithms for metrical task systems
- Limit theorems and structural properties of the cat-and-mouse Markov chain and its generalisations
- Better Bounds for Online Line Chasing
- On-line scheduling with hard deadlines
- Online computation with advice
- ON THE k-TRUCK SCHEDULING PROBLEM
- A dynamic location problem for graphs
- On multi-threaded Paging
- Dynamic pricing of servers on trees
- Approximation and Online Algorithms
- Algorithms for energy conservation in heterogeneous data centers
- Lower bounds in on-line geometric searching
- Two online algorithms for the ambulance systems
- A new lower bound for the list update problem in the partial cost model
- On page migration and other relaxed task systems
- The complexity of mean payoff games
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Online Metric Algorithms with Untrusted Predictions
- Parametrized Metrical Task Systems
- Competitive vertex recoloring. (Online disengagement)
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Chasing convex bodies optimally
- Deterministic 3-server on a circle and the limitation of canonical potentials
- Online paging with heterogeneous cache slots
- The online min-sum set cover problem
- A subquadratic bound for online bisection
- Collective tree exploration via potential function method
- Online deterministic minimum cost bipartite matching with delays on a line
- Online metric allocation and time-varying regularization
- Online deterministic minimum cost bipartite matching with delays on a line
- Maximizing rides served for dial-a-ride on the uniform metric
- Competitive ratio vs regret minimization: achieving the best of both worlds
- Metrical service systems with transformations
- Online paging with a vanishing regret
- Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle
- Online disjoint set covers: randomization is not necessary
- Smoothed analysis of online metric problems
- Shortest paths without a map
- On multi-threaded metrical task systems
- Randomized priority algorithms
- Online chasing problems for regular polygons
This page was built for publication: An optimal on-line algorithm for metrical task system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302787)
