On the online multi-agent O-D \(k\)-Canadian traveler problem (Q2410097): Difference between revisions

@@ Property / cites work @@
+Q3138961
@@ Property / cites work: Q3138961 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
+Normal rank
@@ Property / cites work @@
+Finding the k Shortest Paths
@@ Property / cites work: Finding the k Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+The covering Canadian traveller problem
@@ Property / cites work: The covering Canadian traveller problem / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Canadian traveller problems
@@ Property / cites work: Generalized Canadian traveller problems / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths without a map
@@ Property / cites work: Shortest paths without a map / rank @@
+Normal rank
@@ Property / cites work @@
+Q3159768
@@ Property / cites work: Q3159768 / rank @@
+Normal rank
@@ Property / cites work @@
+A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
+Normal rank
@@ Property / cites work @@
+A note on the \(k\)-Canadian traveller problem
@@ Property / cites work: A note on the \(k\)-Canadian traveller problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Canadian Traveller Problem and its competitive analysis
+Normal rank
@@ Property / cites work @@
+Finding the <i>K</i> Shortest Loopless Paths in a Network
+Normal rank
@@ Property / cites work @@
+The \(k\)-Canadian travelers problem with communication
+Normal rank
@@ Property / cites work @@
+The Steiner traveling salesman problem with online edge blockages
+Normal rank