New lower bounds for online \(k\)-server routing problems

DOI10.1016/j.ipl.2009.01.024zbMath1214.68174DBLPjournals/ipl/FinkKW09OpenAlexW2148393262WikidataQ57851430 ScholiaQ57851430MaRDI QIDQ987824

Sven O. Krumke, Irene Fink, Stephan Westphal

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.024

zbMATH Keywords

competitive analysison-line algorithmsrouting

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Related Items (1)

An Improved Online Algorithm for the Traveling Repairperson Problem on a Line

Cites Work

• News from the online traveling repairman.
• A guessing game and randomized online algorithms
• Online k-Server Routing Problems
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New lower bounds for online \(k\)-server routing problems