Competitive analysis of the online dial-a-ride problem

DOI10.25534/TUPRINTS-00014134MaRDI QIDQ5040444zbMATH OpenOpenAlexFDO

Authors Alexander Birx

Publication date 14 October 2022

Full work available at URL https://d-nb.info/1220031372/34

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1629830
• scientific article; zbMATH DE number 1629851
• 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
• On-line single-server dial-a-ride problems

Cited in

(15)

• B2C online ride-hailing pricing and service optimization under competitions
• Improved bounds for open online dial-a-ride on the line
• scientific article; zbMATH DE number 1629830 (Why is no real title available?)
• scientific article; zbMATH DE number 1629851 (Why is no real title available?)
• Maximizing Revenues for On-Line 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
• Tight Bounds for Online TSP on the Line
• Tight analysis of the Smartstart algorithm for online dial-a-ride on the line
• Approximation and Online Algorithms
• On-line single-server dial-a-ride problems
• Tight analysis of the lazy algorithm for open online dial-a-ride
• An improved algorithm for open online dial-a-ride
• Tight analysis of the lazy algorithm for open online dial-a-ride
• Scheduling on identical machines with setup time and unknown execution time

This page was built for publication: Competitive analysis of the online dial-a-ride problem

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