Tight analysis of the lazy algorithm for open online dial-a-ride

Cites work

Algorithmic Applications in Management
Algorithms for the on-line quota traveling salesman problem
Algorithms for the on-line travelling salesman
An improved algorithm for open online dial-a-ride
An improved online algorithm for the traveling repairperson problem on a line
Approximation and Online Algorithms
Competitive analysis of the online dial-a-ride problem
Computing and Combinatorics
Euler is standing in line dial-a-ride problems with precedence-constraints
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
scientific article; zbMATH DE number 1629830 (Why is no real title available?)
scientific article; zbMATH DE number 1629851 (Why is no real title available?)
scientific article; zbMATH DE number 1947058 (Why is no real title available?)
Improved bounds for open online dial-a-ride on the line
News from the online traveling repairman.
On-line dial-a-ride problems under a restricted information model
On-line single-server dial-a-ride problems
Online k-server routing problems
Online traveling salesman problems with rejection options
Online traveling salesman problems with service flexibility
Online travelling salesman problem on a circle
The on-line asymmetric traveling salesman problem
The online TSP against fair adversaries
Theory and Applications of Models of Computation
Tight analysis of the lazy algorithm for open online dial-a-ride
Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
Tight Bounds for Online TSP on the Line

This page was built for publication: Tight analysis of the lazy algorithm for open online dial-a-ride

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