Competitive algorithms for generalized k-server in uniform metrics
From MaRDI portal
Publication:4607947
zbMATH Open1403.68357arXiv1707.04519MaRDI QIDQ4607947FDOQ4607947
Authors: N. Bansal, Marek Eliáš, Grigorios Koumoutsos, Jesper Nederlof 
Publication date: 15 March 2018
Full work available at URL: https://arxiv.org/abs/1707.04519
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial optimization (90C27)
Cited In (17)
- Memoryless algorithms for the generalized k-server problem on uniform metrics
- Computing the chromatic number using graph decompositions via matrix rank
- The \(k\)-resource problem in uniform metric spaces
- Title not available (Why is that?)
- Metrical service systems with multiple servers
- Metrical service systems with multiple servers
- Competitive Algorithms for Generalized k -Server in Uniform Metrics
- Title not available (Why is that?)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices
- Competitive \(k\)-server algorithms
- The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem
- A polylogarithmic-competitive algorithm for the \(k\)-server problem
- Randomized memoryless algorithms for the weighted and the generalized \(k\)-server problems
- Computing the Chromatic Number Using Graph Decompositions via Matrix Rank
- The online \(k\)-server problem with max-distance objective
- A \(k\)-server problem with parallel requests and unit distances
- The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
This page was built for publication: Competitive algorithms for generalized \(k\)-server in uniform metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607947)
