Competitive algorithms for the bicriteria \(k\)-server problem
From MaRDI portal
Publication:2433801
DOI10.1016/j.dam.2005.04.018zbMath1102.68722MaRDI QIDQ2433801
Michele Flammini, Gaia Nicosia
Publication date: 30 October 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.018
68W40: Analysis of algorithms
90C29: Multi-objective and goal programming
90C27: Combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Competitive snoopy caching
- Balancing minimum spanning trees and shortest-path trees
- Improving spanning trees by upgrading nodes
- An Optimal On-Line Algorithm for K Servers on Trees
- Competitive algorithms for server problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Bicriteria Network Design Problems
- On the k -server conjecture
- The constrained minimum spanning tree problem
- Many birds with one stone