Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications

DOI10.1016/j.jda.2005.12.006zbMath1120.90047OpenAlexW2008747785MaRDI QIDQ849632

Gaia Nicosia, Alfredo Navarra, Michele Flammini

Publication date: 31 October 2006

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.12.006

zbMATH Keywords

bicriteria versionnew polynomial time algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

The fast algorithm for online \(k\)-server problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive snoopy caching
• Approximating the weight of shallow Steiner trees
• An Optimal On-Line Algorithm for K Servers on Trees
• New Ressults on Server Problems
• 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

This page was built for publication: Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications