A pathfinding problem for search trees with unknown edge length
type: Item
instance of: scholarly article
title: A pathfinding problem for search trees with unknown edge length
zbMATH Open document ID: 1400.68156
author: Kunihiko Hiraishi
author: Koichi Kobayashi
published in: Journal of Discrete Algorithms
publication date: 2018-09-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 6944962
zbMATH Keywords: shortest path problem
zbMATH Keywords: planning problem
zbMATH Keywords: online algorithm
MaRDI profile type: Publication
full work available at URL: j.jda.2018.04.002
OpenAlex ID: W2796967789
cites work: Depth-first iterative-deepening: An optimal admissible tree search
DOI: 10.1016/J.JDA.2018.04.002
Recommended article: Finding a length-constrained maximum-density path in a tree
Recommended article: Algorithms and Computation
Recommended article: On the \(K\) shortest path trees problem
Recommended article: Edge and node searching problems on trees
Recommended article: Technical Note—The Complexity of the Optimal Searcher Path Problem
Recommended article: Path Minima in Incremental Unrooted Trees
Recommended article: An optimal algorithm for the maximum-density path in a tree
Recommended article: An efficient algorithm for the length-constrained heaviest path problem on a tree
Recommended article: Path optimization for the resource-constrained searcher
Recommended article: On the tree search problem with non-uniform costs
description: scientific article; zbMATH DE number 6944962