An experimental study of weighted k-link shortest path algorithms
DOI10.1007/978-3-540-68405-3_12zbMATH Open1188.93059OpenAlexW2150591286MaRDI QIDQ3564306FDOQ3564306
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
Recommendations
Programming involving graphs or networks (90C35) Automated systems (robots, etc.) in control theory (93C85) Geometric methods (93B27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The weighted region problem
- Approximating shortest paths on weighted polyhedral surfaces
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- Computing optimal beams in two and three dimensions
- An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
- Title not available (Why is that?)
- Determining an optimal penetration among weighted regions in two and three dimensions
- Title not available (Why is that?)
- Algorithms and Data Structures
- Adaptive and compact discretization for weighted region optimal path finding.
Cited In (4)
Uses Software
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)