An efficient approximation algorithm for weighted region shortest path problem
From MaRDI portal
Recommendations
Cited in
(13)- Path refinement in weighted regions
- A note on the unsolvability of the weighted region shortest path problem
- Approximate shortest homotopic paths in weighted regions
- Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications
- The weighted region problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- Triangulation refinement and approximate shortest paths in weighted regions
- On finding approximate optimal paths in weighted regions
- Adaptive and compact discretization for weighted region optimal path finding.
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- A survey of motion planning algorithms from the perspective of autonomous UAV guidance
- Shortest monotone descent path problem in polyhedral terrain
This page was built for publication: An efficient approximation algorithm for weighted region shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2749787)