Online travelling salesman problem on a circle

DOI10.1007/978-3-030-14812-6_20OpenAlexW2936933987MaRDI QIDQ2327484

P. S. Srinivasan, V. N. Muralidhara, Vinay A. Jawgal

Publication date: 15 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-14812-6_20

zbMATH Keywords

online algorithmscompetitive ratiotravelling salesman problem

Mathematics Subject Classification ID

Related Items (3)

New Bounds for Maximizing Revenue in Online Dial-a-Ride ⋮ Tight analysis of the lazy algorithm for open online dial-a-ride ⋮ An improved algorithm for open online dial-a-ride

This page was built for publication: Online travelling salesman problem on a circle