Competitive online routing in geometric graphs (Q1887089): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2004.05.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2119251691
@@ Property / OpenAlex ID: W2119251691 / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in the plane
@@ Property / cites work: Searching in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q4834367
@@ Property / cites work: Q4834367 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4223058
@@ Property / cites work: Q4223058 / rank @@
+Normal rank
@@ Property / cites work @@
+ONLINE ROUTING IN CONVEX SUBDIVISIONS
@@ Property / cites work: ONLINE ROUTING IN CONVEX SUBDIVISIONS / rank @@
+Normal rank
@@ Property / cites work @@
+Q4411362
@@ Property / cites work: Q4411362 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Routing in Triangulations
@@ Property / cites work: Online Routing in Triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484375
@@ Property / cites work: Q3484375 / rank @@
+Normal rank
@@ Property / cites work @@
+Delaunay graphs are almost as good as complete graphs
+Normal rank
@@ Property / cites work @@
+Constructing competitive tours from local information
+Normal rank
@@ Property / cites work @@
+Shortest paths without a map
@@ Property / cites work: Shortest paths without a map / rank @@
+Normal rank