An improved lower bound for competitive graph exploration (Q831137): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2021.04.003
@@ Property / DOI: 10.1016/j.tcs.2021.04.003 / rank @@
-Normal rank
@@ Property / cites work @@
+Exploring Unknown Environments
@@ Property / cites work: Exploring Unknown Environments / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted nearest neighbor algorithms for the graph exploration problem on cycles
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Online TSP on the Line
@@ Property / cites work: Tight Bounds for Online TSP on the Line / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring sparse graphs with advice (extended abstract)
+Normal rank
@@ Property / cites work @@
+Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs
+Normal rank
@@ Property / cites work @@
+Exploring an unknown graph
@@ Property / cites work: Exploring an unknown graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fast collaborative graph exploration
@@ Property / cites work: Fast collaborative graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents
+Normal rank
@@ Property / cites work @@
+A general lower bound for collaborative tree exploration
+Normal rank
@@ Property / cites work @@
+Online Graph Exploration with Advice
@@ Property / cites work: Online Graph Exploration with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+Why Robots Need Maps
@@ Property / cites work: Why Robots Need Maps / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower and upper competitive bounds for online directed graph exploration
+Normal rank
@@ Property / cites work @@
+Collective tree exploration
@@ Property / cites work: Collective tree exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Graph exploration by a finite automaton
@@ Property / cites work: Graph exploration by a finite automaton / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Graph Exploration with Advice
@@ Property / cites work: Deterministic Graph Exploration with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+Online graph exploration algorithms for cycles and trees by multiple searchers
+Normal rank
@@ Property / cites work @@
+On the nearest neighbor rule for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Constructing competitive tours from local information
+Normal rank
@@ Property / cites work @@
+Online graph exploration: New results on old and new algorithms
+Normal rank
@@ Property / cites work @@
+A Recursive Approach to Multi-robot Exploration of Trees
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2021.04.003
@@ Property / DOI: 10.1016/J.TCS.2021.04.003 / rank @@
+Normal rank