scientific article
From MaRDI portal
Publication:3138961
zbMath0800.68642MaRDI QIDQ3138961
Baruch Schieber, Amotz Bar-Noy
Publication date: 20 October 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (30)
Constructing competitive tours from local information ⋮ Constructing competitive tours from local information ⋮ Robust optimization for routing problems on trees ⋮ Approximation and complexity of multi-target graph search and the Canadian traveler problem ⋮ The Steiner traveling salesman problem with online edge blockages ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ The \(k\)-Canadian travelers problem with communication ⋮ Approximating the Canadian traveller problem with online randomization ⋮ Shortest paths with shortest detours. A biobjective routing problem ⋮ On the online multi-agent O-D \(k\)-Canadian traveler problem ⋮ Complexity of Canadian traveler problem variants ⋮ 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 ⋮ 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 ⋮ Canadian traveller problem with predictions ⋮ Online interval scheduling with a bounded number of failures ⋮ Discussion of ``Network routing in a dynamic environment ⋮ The covering Canadian traveller problem ⋮ The k-Canadian Travelers Problem with Communication ⋮ The reset disambiguation policy for navigating stochastic obstacle fields ⋮ A note on the \(k\)-Canadian traveller problem ⋮ Multiple canadians on the road: minimizing the distance competitive ratio ⋮ Efficient, optimal stochastic-action selection when limited by an action budget ⋮ Finding the anti-block vital edge of a shortest path between two nodes ⋮ The Canadian Traveller Problem and its competitive analysis ⋮ A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem ⋮ 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
This page was built for publication:
