The Canadian Traveller Problem Revisited

DOI10.1007/978-3-642-35261-4_38zbMath1260.90138OpenAlexW2283577276MaRDI QIDQ4909552

Yamming Huang, Chung-Shou Liao

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_38

zbMATH Keywords

competitive ratiotravelling salesman problemCanadian traveller problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Canadian traveller problem with predictions ⋮ The covering Canadian traveller problem ⋮ An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths

This page was built for publication: The Canadian Traveller Problem Revisited