On the complexity of minimum-link path problems
From MaRDI portal
Publication:3132885
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)
Recommendations
Cited in
(8)- Global optimization: On pathlengths in min-max graphs
- Structured discrete shape approximation: theoretical complexity and practical algorithm
- The Minimum Reload s-t Path/Trail/Walk Problems
- The minimum reload \(s-t\) path, trail and walk problems
- scientific article; zbMATH DE number 6707504 (Why is no real title available?)
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
- Minimum-link paths revisited
- Link-Length Minimization in Networks
This page was built for publication: On the complexity of minimum-link path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132885)