Online graph exploration on trees, unicyclic graphs and cactus graphs

DOI10.1016/j.ipl.2021.106096OpenAlexW3017016309MaRDI QIDQ2656355

Robin Fritsch

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.06690

zbMATH Keywords

on-line algorithmsnearest neighborgraph exploration

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

On-line exploration of rectangular cellular environments with a rectangular hole

Cites Work

• Unnamed Item
• Shortest paths without a map
• Constructing competitive tours from local information
• On the nearest neighbor rule for the traveling salesman problem
• Online graph exploration: New results on old and new algorithms
• Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs
• Competitive concurrent distributed queuing
• Online Graph Exploration with Advice
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Exploring Unknown Environments
• Algorithms – ESA 2005

This page was built for publication: Online graph exploration on trees, unicyclic graphs and cactus graphs