Online graph exploration: New results on old and new algorithms (Q1929219): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2012.06.034
@@ Property / DOI: 10.1016/j.tcs.2012.06.034 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.06.034
+Normal rank
@@ Property / OpenAlex ID @@
+W105334049
@@ Property / OpenAlex ID: W105334049 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57399761
@@ Property / Wikidata QID: Q57399761 / 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 @@
+Algorithms for the on-line travelling salesman
@@ Property / cites work: Algorithms for the on-line travelling salesman / rank @@
+Normal rank
@@ Property / cites work @@
+Piecemeal graph exploration by a mobile robot.
@@ Property / cites work: Piecemeal graph exploration by a mobile robot. / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in the plane
@@ Property / cites work: Searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+An adversarial queueing model for online server routing
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal graph exploration without good maps
@@ Property / cites work: Optimal graph exploration without good maps / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal constrained graph exploration
@@ Property / cites work: Optimal constrained graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Smart Robot Teams Exploring Sparse Trees
@@ Property / cites work: Smart Robot Teams Exploring Sparse Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Why Robots Need Maps
@@ Property / cites work: Why Robots Need Maps / rank @@
+Normal rank
@@ Property / cites work @@
+Arc Routing Problems, Part I: The Chinese Postman Problem
+Normal rank
@@ Property / cites work @@
+Graph Theory and Probability
@@ Property / cites work: Graph Theory and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725269
@@ Property / cites work: Q5725269 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic cage survey
@@ Property / cites work: Dynamic cage survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4426350
@@ Property / cites work: Q4426350 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Collective tree exploration
@@ Property / cites work: Collective tree exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Impact of memory size on graph exploration capability
+Normal rank
@@ Property / cites work @@
+Search games
@@ Property / cites work: Search games / rank @@
+Normal rank
@@ Property / cites work @@
+Memory Efficient Anonymous Graph Exploration
@@ Property / cites work: Memory Efficient Anonymous Graph Exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms for searching and exploration in the plane
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+On the nearest neighbor rule for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Online Vehicle Routing Problems: A Survey
@@ Property / cites work: Online Vehicle Routing Problems: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing competitive tours from local information
+Normal rank
@@ Property / cites work @@
+Q3007438
@@ Property / cites work: Q3007438 / rank @@
+Normal rank
@@ Property / cites work @@
+On a simple depth-first search strategy for exploring unknown graphs
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring Unknown Undirected Graphs
@@ Property / cites work: Exploring Unknown Undirected Graphs / 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 @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2012.06.034
@@ Property / DOI: 10.1016/J.TCS.2012.06.034 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1929219