Finding an optimal path without growing the tree

DOI10.1016/S0196-6774(03)00080-4MaRDI QIDQ4820903zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Ovidiu Daescu, Jinhui Xu, Xiaobo (Sharon) Hu

Publication date 1 October 2004

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

Full work available at URL https://doi.org/10.1016/s0196-6774(03)00080-4

zbMATH Keywords

clipped treesmarriage-before-conquerprune-and-search technique

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1305095
• Finding Many Optimal Paths Without Growing Any Optimal Path Trees
• Finding many optimal paths without growing any optimal path trees
• A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane
• Shortest paths in the plane with polygonal obstacles

Cited in

(7)

• Algorithms for interval structures with applications
• Finding Many Optimal Paths Without Growing Any Optimal Path Trees
• Algorithms for interval structures with applications
• scientific article; zbMATH DE number 1305095 (Why is no real title available?)
• scientific article; zbMATH DE number 1145908 (Why is no real title available?)
• Computing feasible toolpaths for 5-axis machines
• Finding many optimal paths without growing any optimal path trees

This page was built for publication: Finding an optimal path without growing the tree

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