The Canadian traveller problem revisited

DOI10.1007/978-3-642-35261-4_38MaRDI QIDQ4909552zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Generalized Canadian traveller problems
• The Canadian Traveller Problem and its competitive analysis
• The covering Canadian traveller problem
• Canadians should travel randomly
• Multiple canadians on the road: minimizing the distance competitive ratio

Cited in

(9)

• Canadian traveller problem with predictions
• The \(k\)-Canadian travelers problem with communication
• A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
• The Canadian Traveller Problem and its competitive analysis
• Multiple canadians on the road: minimizing the distance competitive ratio
• Generalized Canadian traveller problems
• The covering Canadian traveller problem
• The Toronto 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909552)