scientific article; zbMATH DE number 432827
From MaRDI portal
Publication:3138961
zbMATH Open0800.68642MaRDI QIDQ3138961FDOQ3138961
Authors: Amotz Bar-Noy, Baruch Schieber 
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (30)
- Shortest paths with shortest detours. A biobjective routing problem
- Efficient, optimal stochastic-action selection when limited by an action budget
- Canadian traveller problem with predictions
- The reset disambiguation policy for navigating stochastic obstacle fields
- Finding the anti-block vital edge of a shortest path between two nodes
- Approximation and complexity of multi-target graph search and the Canadian traveler problem
- The \(k\)-Canadian travelers problem with communication
- Robust optimization for routing problems on trees
- The Steiner traveling salesman problem with online edge blockages
- The Steiner traveling salesman problem with online advanced edge blockages
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- A note on the \(k\)-Canadian traveller problem
- On the randomized online strategies for the \(k\)-Canadian traveler problem
- Constructing competitive tours from local information
- Approximating the Canadian traveller problem with online randomization
- The Canadian Traveller Problem and its competitive analysis
- Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem
- Discussion of ``Network routing in a dynamic environment
- Complexity of planning for connected agents in a partially known environment
- Constructing competitive tours from local information
- Multiple canadians on the road: minimizing the distance competitive ratio
- The \(k\)-Canadian travelers problem with communication
- Generalized Canadian traveller problems
- Online interval scheduling with a bounded number of failures
- The covering Canadian traveller problem
- Complexity of Canadian traveler problem variants
- Optimal shortest path set problem in undirected graphs
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the 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)
