scientific article; zbMATH DE number 432827

MaRDI QIDQ3138961zbMATH OpenFDO

Authors Amotz Bar-Noy, Baruch Schieber

Publication date 20 October 1993

zbMATH Keywords

Canadian Traveller Problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(34)

• Finding the anti-block vital edge of a shortest path between two nodes
• The Canadian Traveller Problem and its competitive analysis
• Constructing competitive tours from local information
• Approximation and complexity of multi-target graph search and the Canadian traveler problem
• The Steiner traveling salesman problem with online advanced edge blockages
• Shortest paths with shortest detours. A biobjective routing problem
• Online interval scheduling with a bounded number of failures
• Multiple canadians on the road: minimizing the distance competitive ratio
• Optimal shortest path set problem in undirected graphs
• Generalized Canadian traveller problems
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
• The \(k\)-Canadian travelers problem with communication
• On the online multi-agent O-D \(k\)-Canadian traveler problem
• Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem
• On the randomized online strategies for the \(k\)-Canadian traveler problem
• The covering Canadian traveller problem
• Approximating the Canadian traveller problem with online randomization
• Complexity of planning for connected agents in a partially known environment
• The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem
• The \(k\)-Canadian travelers problem with communication
• The reset disambiguation policy for navigating stochastic obstacle fields
• Robust optimization for routing problems on trees
• The Steiner traveling salesman problem with online edge blockages
• Complexity of Canadian traveler problem variants
• Constructing competitive tours from local information
• A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
• Efficient, optimal stochastic-action selection when limited by an action budget
• Canadian traveller problem with predictions
• Discussion of ``Network routing in a dynamic environment
• The Canadian traveller problem on outerplanar graphs
• Canadian traveler problems in temporal graphs
• The Canadian traveller problem on unit-weighted and arbitrarily weighted outerplanar graphs
• Navigation algorithms for optimal pathfinding in the stochastic obstacle scene problem
• A note on the k-Canadian traveller problem

This page was built for publication:

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