An experimental study of weighted k-link shortest path algorithms

DOI10.1007/978-3-540-68405-3_12MaRDI QIDQ3564306zbMATH OpenOpenAlexFDO

Authors Ovidiu Daescu, Joseph S. B. Mitchell, James Dean Palmer, Simeon C. Ntafos, Chee K. Yap

Publication date 2 June 2010

Published in Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68405-3_12

zbMATH Keywords

performance studyminimum-weight polygonal pathweighted polygonal subdivision

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Automated systems (robots, etc.) in control theory (93C85) Geometric methods (93B27)

Recommendations

• Algorithms and Data Structures
• The weighted region problem
• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 1256695
• An experimental study on approximating \(k\) shortest simple paths

Cites work

• scientific article; zbMATH DE number 1256695 (Why is no real title available?)
• scientific article; zbMATH DE number 2088185 (Why is no real title available?)
• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• Adaptive and compact discretization for weighted region optimal path finding.
• Algorithms and Data Structures
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Approximating shortest paths on weighted polyhedral surfaces
• Approximation algorithms for geometric shortest path problems
• Computing optimal beams in two and three dimensions
• Determining an optimal penetration among weighted regions in two and three dimensions
• Determining approximate shortest paths on weighted polyhedral surfaces
• The weighted region problem

Cited in

(4)

• scientific article; zbMATH DE number 5630701 (Why is no real title available?)
• Algorithms and Data Structures
• Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
• Path refinement in weighted regions

Describes a project that uses

Uses Software

• BUSHWHACK

This page was built for publication: An experimental study of weighted \(k\)-link shortest path algorithms

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