Competitive analysis of the online dial-a-ride problem

DOI10.25534/tuprints-00014134zbMath1496.68009OpenAlexW3097134967MaRDI QIDQ5040444

Alexander Birx

Publication date: 14 October 2022

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

Mathematics Subject Classification ID

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

Related Items (3)

Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ An improved algorithm for open online dial-a-ride ⋮ Improved bounds for open online dial-a-ride on the line

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