Computing shortest heterochromatic monotone routes (Q2517794): Difference between revisions

@@ Property / cites work @@
+New Results on Dynamic Planar Point Location
@@ Property / cites work: New Results on Dynamic Planar Point Location / rank @@
+Normal rank
@@ Property / cites work @@
+TSP with neighborhoods of varying size
@@ Property / cites work: TSP with neighborhoods of varying size / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of Point Sets by 1-Corner Polygonal Chains
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A sweepline algorithm for Voronoi diagrams
@@ Property / cites work: A sweepline algorithm for Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Trees and Dynamic Point Location
@@ Property / cites work: Dynamic Trees and Dynamic Point Location / rank @@
+Normal rank
@@ Property / cites work @@
+Q4401014
@@ Property / cites work: Q4401014 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934576
@@ Property / cites work: Q2934576 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4361347
@@ Property / cites work: Q4361347 / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank