Online TSP with known locations

DOI10.1007/978-3-031-38906-1_5arXiv2210.14722MaRDI QIDQ6138990

Michalis Xefteris, Bruno Escoffier, Niklas Hahn, Evripidis Bampis

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.14722

zbMATH Keywords

TSPcompetitive analysisonline algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the on-line quota traveling salesman problem
• The on-line asymmetric traveling salesman problem
• The Online TSP Against Fair Adversaries
• Routing and Scheduling on a Shoreline with Release Times
• Computing and Combinatorics
• Algorithms for the on-line travelling salesman

This page was built for publication: Online TSP with known locations