Lower and upper competitive bounds for online directed graph exploration (Q343923): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2015.11.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2262759985
@@ Property / OpenAlex ID: W2262759985 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57310485
@@ Property / Wikidata QID: Q57310485 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring Unknown Environments
@@ Property / cites work: Exploring Unknown Environments / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417632
@@ Property / cites work: Q5417632 / rank @@
+Normal rank
@@ Property / cites work @@
+The on-line asymmetric traveling salesman problem
@@ Property / cites work: The on-line asymmetric traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Anonymous graph exploration without collision by mobile robots
+Normal rank
@@ Property / cites work @@
+Connected graph searching
@@ Property / cites work: Connected graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+The power of a pebble: Exploring and mapping directed graphs
+Normal rank
@@ Property / cites work @@
+A new approximation algorithm for the asymmetric TSP with triangle inequality
+Normal rank
@@ Property / cites work @@
+Exclusive Graph Searching
@@ Property / cites work: Exclusive Graph Searching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3090934
@@ Property / cites work: Q3090934 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+Network Exploration by Silent and Oblivious Robots
+Normal rank
@@ Property / cites work @@
+Map construction of unknown graphs by multiple agents
+Normal rank
@@ Property / cites work @@
+Exploring an unknown graph
@@ Property / cites work: Exploring an unknown graph / rank @@
+Normal rank
@@ Property / cites work @@
+Tree exploration with little memory
@@ Property / cites work: Tree exploration with little memory / rank @@
+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 @@
+How Many Ants Does It Take to Find the Food?
@@ Property / cites work: How Many Ants Does It Take to Find the Food? / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the ANTS Problem with Asynchronous Finite State Machines
+Normal rank
@@ Property / cites work @@
+An explicit lower bound for TSP with distances one and two
+Normal rank
@@ Property / cites work @@
+Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
+Normal rank
@@ Property / cites work @@
+Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
+Normal rank
@@ Property / cites work @@
+Collaborative search on the plane without communication
+Normal rank
@@ Property / cites work @@
+Competitive Online Approximation of the Optimal Search Ratio
+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 @@
+An annotated bibliography on guaranteed graph searching
+Normal rank
@@ Property / cites work @@
+Collective tree exploration
@@ Property / cites work: Collective tree exploration / rank @@
+Normal rank
@@ Property / cites work @@
+STACS 2004
@@ Property / cites work: STACS 2004 / 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 @@
+Tree exploration with advice
@@ Property / cites work: Tree exploration with advice / rank @@
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Search games
@@ Property / cites work: Search games / rank @@
+Normal rank
@@ Property / cites work @@
+The vehicle routing problem. Latest advances and new challenges.
+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 @@
+Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
+Normal rank
@@ Property / cites work @@
+Treasure Hunt with Advice
@@ Property / cites work: Treasure Hunt with Advice / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Data Aggregation in Directed Networks
+Normal rank
@@ Property / cites work @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Online graph exploration: New results on old and new algorithms
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3208679
@@ Property / cites work: Q3208679 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Shortest paths in Euclidean graphs
@@ Property / cites work: Shortest paths in Euclidean graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Special issue: Selected papers based on the presentations at the 4th workshop on GRAph searching, theory and applications, GRASTA 2011, February 13--18, 2012. Dedicated to Professor Lefteris M. Kirousis on the occasion of his 60th birthday
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
+Normal rank