On discretization methods for approximating optimal paths in regions with direction-dependent costs (Q1045920): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.10.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2048876543
@@ Property / OpenAlex ID: W2048876543 / rank @@
+Normal rank
@@ Property / cites work @@
+An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
+Normal rank
@@ Property / cites work @@
+Fundamentals of Computation Theory
@@ Property / cites work: Fundamentals of Computation Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Determining approximate shortest paths on weighted polyhedral surfaces
+Normal rank
@@ Property / cites work @@
+Approximating shortest paths on weighted polyhedral surfaces
+Normal rank
@@ Property / cites work @@
+Q4945516
@@ Property / cites work: Q4945516 / rank @@
+Normal rank
@@ Property / cites work @@
+The weighted region problem
@@ Property / cites work: The weighted region problem / rank @@
+Normal rank
@@ Property / cites work @@
+Movement planning in the presence of flows
@@ Property / cites work: Movement planning in the presence of flows / rank @@
+Normal rank
@@ Property / cites work @@
+On finding approximate optimal paths in weighted regions
+Normal rank