The Canadian tour operator problem on paths: tight bounds and resource augmentation

DOI10.1007/S10878-015-9905-7zbMath1354.90151OpenAlexW384563215MaRDI QIDQ326483

Sven O. Krumke, Sabine Büttner

Publication date: 12 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9905-7

zbMATH Keywords

competitive analysisonline computationgraph explorationresource augmentation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions

Cites Work

• A note on the \(k\)-Canadian traveller problem
• The online prize-collecting traveling salesman problem
• Online algorithms. The state of the art
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
• Online Graph Exploration: New Results on Old and New Algorithms
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• The prize collecting traveling salesman problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Canadian tour operator problem on paths: tight bounds and resource augmentation