Finding an optimal path without growing the tree

DOI10.1016/S0196-6774(03)00080-4zbMath1079.68070OpenAlexW1981520858MaRDI QIDQ4820903

Jinhui Xu, Ovidiu Daescu, Danny Z. Chen, 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

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

Related Items

Algorithms for interval structures with applications ⋮ Computing feasible toolpaths for 5-axis machines ⋮ Algorithms for Interval Structures with Applications ⋮ FINDING MANY OPTIMAL PATHS WITHOUT GROWING ANY OPTIMAL PATH TREES