Serving requests with on-line routing

DOI10.1007/3-540-58218-5_4zbMath1502.68373OpenAlexW1510762354MaRDI QIDQ5056164

Maurizio Talamo, Esteban Feuerstein, Stefano Leonardi, Giorgio Ausiello, Leen Stougie

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_4

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Competitive algorithms for the on-line traveling salesman ⋮ An Improved Online Algorithm for the Traveling Repairperson Problem on a Line ⋮ Routing of platforms in a maritime surface surveillance operation ⋮ Two short notes on the on-line travelling salesman: handling times and lookahead.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Routing and Scheduling on a Shoreline with Release Times
• Competitive algorithms for server problems
• Self-adjusting binary search trees
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
• Preemptive Ensemble Motion Planning on a Tree
• A Note on the Complexity of a Simple Transportation Problem
• Constructing competitive tours from local information

This page was built for publication: Serving requests with on-line routing