1986/08/01 by Hans Rohnert · 1 citation
Computer Science · Mathematics · #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex hull #Dijkstra's algorithm #Disjoint sets #Euclidean shortest path #Floyd–Warshall algorithm #Geometry #Graph #K shortest path routing #Mathematics #Optimization and Search Problems #Path (computing) #Plane (geometry) #Regular polygon #Robotic Path Planning Algorithms #Shortest Path Faster Algorithm #Shortest path problem #Yen's algorithm
paper · doi:10.1016/0020-0190(86)90045-1
crossref issued 1986/08/01 · crossref published 1986/08/01 · crossref published-print 1986/08/01 · openalex publication_date 1986/08/01 · crossref created 2003/03/14 · crossref deposited 2019/03/26 · openalex created_date 2025/10/10 · crossref indexed 2026/07/09 · openalex updated_date 2026/07/23