A pathfinding problem for search trees with unknown edge length

DOI10.1016/J.JDA.2018.04.002zbMATH Open1400.68156OpenAlexW2796967789MaRDI QIDQ1784979FDOQ1784979

Authors: Kunihiko Hiraishi, Koichi Kobayashi 

Publication date: 27 September 2018

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.04.002

Recommendations

• Finding a length-constrained maximum-density path in a tree
• Algorithms and Computation
• On the \(K\) shortest path trees problem
• Edge and node searching problems on trees
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Path Minima in Incremental Unrooted Trees
• An optimal algorithm for the maximum-density path in a tree
• An efficient algorithm for the length-constrained heaviest path problem on a tree
• Path optimization for the resource-constrained searcher
• On the tree search problem with non-uniform costs

zbMATH Keywords

shortest path problemonline algorithmplanning problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search

Cited In (5)

• Backtracking problem in the traversal of an unknown directed graph by a finite robot
• Title not available (Why is that?)
• Finding a length-constrained maximum-density path in a tree
• Algorithms and Computation
• Path Minima in Incremental Unrooted Trees

This page was built for publication: A pathfinding problem for search trees with unknown edge length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784979)