On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis

DOI10.1007/978-3-642-02882-3_18zbMath1248.68584OpenAlexW1582845317MaRDI QIDQ5323061

Alexander Souza, Axel Simroth

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_18

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Online traveling salesman problem with time cost and non-zealous server

Cites Work

• Unnamed Item
• Unnamed Item
• On the power of lookahead in on-line server routing problems
• An adversarial queueing model for online server routing
• News from the online traveling repairman.
• The complexity of the travelling repairman problem
• Scheduling Parallel Machines On-Line
• Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
• On-line single-server dial-a-ride problems

This page was built for publication: On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis