scientific article; zbMATH DE number 1947058

MaRDI QIDQ4411288zbMATH OpenFDO

Authors Luigi Laura, Maarten Lipmann, Willem E. De Paepe, Diana Poensgen, Sven O. Krumke, Alberto Marchetti-Spaccamela, L. Stougie

Publication date 7 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2462/24620200.htm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1629852
• News from the online traveling repairman.
• The online TSP against fair adversaries
• Competitive algorithms for the on-line traveling salesman
• Online traveling salesman problem with time cost and non-zealous server

Cited in

(22)

• Evaluating the quality of online optimization algorithms by discrete event simulation
• The online food delivery problem on stars
• How to whack moles
• Topology matters: smoothed competitiveness of metrical task systems
• Improved bounds for open online dial-a-ride on the line
• scientific article; zbMATH DE number 1629852 (Why is no real title available?)
• The online TSP against fair adversaries
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• An improved online algorithm for the traveling repairperson problem on a line
• On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
• New policies for the dynamic traveling salesman problem
• scientific article; zbMATH DE number 7650088 (Why is no real title available?)
• Minimizing the maximum flow time in the online food delivery problem
• Tight analysis of the lazy algorithm for open online dial-a-ride
• An improved algorithm for open online dial-a-ride
• Maximizing the number of rides served for time-limited Dial-a-Ride*
• Tight analysis of the lazy algorithm for open online dial-a-ride
• Traveling repairperson, unrelated machines, and other stories about average completion times
• Online k-server routing problems
• On the power of lookahead in on-line server routing problems
• An adversarial queueing model for online server routing

This page was built for publication:

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