Discrete online TSP

DOI10.1007/978-3-642-02158-9_5zbMath1246.90125OpenAlexW1513781821MaRDI QIDQ3638442

Gustavo Sadovoy, Mauro Aprea, Alejandro Strejilevich De Loma, Esteban Feuerstein

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_5

zbMATH Keywords

TSPonline algorithmsdiscrete metric spaces

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• The on-line asymmetric traveling salesman problem
• Online algorithms. The state of the art
• Competitive snoopy caching
• The Online TSP Against Fair Adversaries
• Routing and Scheduling on a Shoreline with Release Times
• An Asymptotic, Probabilistic Analysis of a Routing Problem
• Beyond Competitive Analysis
• Algorithms for the on-line travelling salesman

This page was built for publication: Discrete online TSP