Online k-Server Routing Problems

DOI10.1007/11970125_7MaRDI QIDQ5443511zbMATH OpenOpenAlexFDO

Authors Vincenzo Bonifaci, L. Stougie

Publication date 21 February 2008

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11970125_7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Online k-server routing problems
• New lower bounds for online k-server routing problems
• The 3-server problem in the plane.
• Serving requests with on-line routing
• On-line algorithms for the dynamic traveling repair problem

Cited in

(17)

• News from the online traveling repairman.
• Online in-time service problem with minimal server assignment
• Metrical service systems with multiple servers
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online Vehicle Routing Problems: A Survey
• On the On-Line Weighted k-Taxi Problem
• Online service with delay
• Online service with delay
• Serving requests with on-line routing
• An improved online algorithm for the traveling repairperson problem on a line
• The online k-taxi problem
• scientific article; zbMATH DE number 969167 (Why is no real title available?)
• The Online Transportation Problem: On the Exponential Boost of One Extra Server
• Online k-server routing problems
• On the power of lookahead in on-line server routing problems
• New lower bounds for online k-server routing problems

This page was built for publication: Online k-Server Routing Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443511)