Linear-size planar Manhattan network for convex point sets (Q824337): Difference between revisions

@@ Property / DOI @@
-.1016/j.comgeo.2021.101819
@@ Property / DOI: 10.1016/j.comgeo.2021.101819 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.06457
@@ Property / arXiv ID: 1909.06457 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2748154
@@ Property / cites work: Q2748154 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Manhattan network is NP-complete
@@ Property / cites work: Minimum Manhattan network is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4427856
@@ Property / cites work: Q4427856 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum Manhattan network problem: Approximations and exact solutions
+Normal rank
@@ Property / cites work @@
+GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS
+Normal rank
@@ Property / cites work @@
+Q2968082
@@ Property / cites work: Q2968082 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the generalized minimum Manhattan network problem
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Arborescence Problem Is NP-Complete
+Normal rank
@@ Property / cites work @@
+The rectilinear Steiner arborescence problem
@@ Property / cites work: The rectilinear Steiner arborescence problem / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation scheme for the rectilinear Steiner arborescence problem
+Normal rank
@@ Property / cites work @@
+Q4028874
@@ Property / cites work: Q4028874 / rank @@
+Normal rank
@@ Property / cites work @@
+On the stretch factor of Delaunay triangulations of points in convex position
+Normal rank
@@ Property / cites work @@
+The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
+Normal rank
@@ Property / cites work @@
+Planar spanners and approximate shortest path queries among obstacles in the plane
+Normal rank
@@ Property / cites work @@
+A plane 1.88-spanner for points in convex position
+Normal rank
@@ Property / cites work @@
+AN OPTIMAL DATA STRUCTURE FOR SHORTEST RECTILINEAR PATH QUERIES IN A SIMPLE RECTILINEAR POLYGON
+Normal rank
@@ Property / cites work @@
+On rectilinear link distance
@@ Property / cites work: On rectilinear link distance / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graph decomposition and all pairs shortest paths
+Normal rank
@@ Property / cites work @@
+Q3359792
@@ Property / cites work: Q3359792 / rank @@
+Normal rank
@@ Property / cites work @@
+A rounding algorithm for approximating minimum Manhattan networks
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684121
@@ Property / cites work: Q3684121 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric biplane graphs. II: Graph augmentation
@@ Property / cites work: Geometric biplane graphs. II: Graph augmentation / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.COMGEO.2021.101819
@@ Property / DOI: 10.1016/J.COMGEO.2021.101819 / rank @@
+Normal rank