Online \(k\)-server routing problems

DOI10.1007/s00224-008-9103-4zbMath1170.90503OpenAlexW2101894691MaRDI QIDQ839628

Vincenzo Bonifaci, Leen Stougie

Publication date: 2 September 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-008-9103-4

zbMATH Keywords

traveling salesmancompetitive analysisonline algorithmstraveling repairmanserver routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (5)

Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ An improved algorithm for open online dial-a-ride ⋮ Car-sharing between two locations: online scheduling with flexible advance bookings ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ The online \(k\)-server problem with max-distance objective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adversarial queueing model for online server routing
• Scheduling on identical machines: How good is LPT in an on-line setting?
• News from the online traveling repairman.
• Randomized algorithms for on-line scheduling problems: How low can't you go?
• On randomization in on-line computation.
• On-line dial-a-ride problems under a restricted information model
• The Online TSP Against Fair Adversaries
• Competitive algorithms for server problems
• LP-Based Online Scheduling: From Single to Parallel Machines
• Speed is as powerful as clairvoyance
• Algorithms and Data Structures
• LATIN 2004: Theoretical Informatics
• Algorithms for the on-line travelling salesman
• On-line single-server dial-a-ride problems

This page was built for publication: Online \(k\)-server routing problems