Online graph exploration: New results on old and new algorithms
type: Item
instance of: scholarly article
title: Online graph exploration: New results on old and new algorithms
zbMATH Open document ID: 1269.05103
author: Nicole Megow
author: K. Mehlhorn
author: P. Schweitzer
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6122456
zbMATH Keywords: graph exploration
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.034
OpenAlex ID: W105334049
Wikidata QID: Q57399761
cites work: Exploring Unknown Environments
cites work: Weighted nearest neighbor algorithms for the graph exploration problem on cycles
cites work: Algorithms for the on-line travelling salesman
cites work: Piecemeal graph exploration by a mobile robot.
cites work: Searching in the plane
cites work: Online algorithms. The state of the art
cites work: An adversarial queueing model for online server routing
cites work: Q4223058
cites work: Optimal graph exploration without good maps
cites work: Optimal constrained graph exploration
cites work: Smart Robot Teams Exploring Sparse Trees
cites work: Why Robots Need Maps
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Graph Theory and Probability
cites work: Q5725269
cites work: Dynamic cage survey
cites work: Q4426350
cites work: Algorithms – ESA 2005
cites work: Collective tree exploration
cites work: Impact of memory size on graph exploration capability
cites work: Search games
cites work: Memory Efficient Anonymous Graph Exploration
cites work: Online algorithms for searching and exploration in the plane
cites work: The traveling salesman problem and its variations
cites work: On the nearest neighbor rule for the traveling salesman problem
cites work: Online Vehicle Routing Problems: A Survey
cites work: Constructing competitive tours from local information
cites work: Q3007438
cites work: On a simple depth-first search strategy for exploring unknown graphs
cites work: Q5187226
cites work: Graphs on surfaces
cites work: Exploring Unknown Undirected Graphs
cites work: Shortest paths without a map
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
DOI: 10.1016/J.TCS.2012.06.034
Recommended article: Online Graph Exploration: New Results on Old and New Algorithms
Recommended article: Online graph exploration algorithms for cycles and trees by multiple searchers
Recommended article: Lower and upper competitive bounds for online directed graph exploration
Recommended article: Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs
Recommended article: Online graph exploration on trees, unicyclic graphs and cactus graphs
Recommended article: Online Graph Exploration with Advice
Recommended article: Q3140445
Recommended article: On Traversing Layered Graphs On-Line
Recommended article: Relaxing the irrevocability requirement for online graph algorithms
description: scientific article; zbMATH DE number 6122456