A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem

DOI10.1007/978-3-540-85097-7_39zbMath1168.90599OpenAlexW2126376957MaRDI QIDQ5505679

Peng Xiao, Lei Tian, Bing Su, Yin-Feng Xu

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_39

zbMATH Keywords

competitive analysiscomparison strategyrisk-reward modelrecoverable-CTP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

On the online multi-agent O-D \(k\)-Canadian traveler problem ⋮ The covering Canadian traveller problem ⋮ Generalized Canadian traveller problems ⋮ An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest paths without a map
• A note on the \(k\)-Canadian traveller problem
• The Canadian Traveller Problem and its competitive analysis
• Online algorithms. The state of the art
• A new measure for the study of on-line algorithms
• Competitive \(k\)-server algorithms
• A risk-reward framework for the competitive analysis of financial games

This page was built for publication: A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem