Computational complexity for the problem of optimal intersection of straight line segments by disks (Q2424188): Difference between revisions

@@ Property / cites work @@
+Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions
+Normal rank
@@ Property / cites work @@
+Optimal algorithms for some intersection radius problems
+Normal rank
@@ Property / cites work @@
+Competitive Online Routing on Delaunay Triangulations
+Normal rank
@@ Property / cites work @@
+Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
+Normal rank
@@ Property / cites work @@
+Exact algorithms and APX-hardness results for geometric packing and covering problems
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Routing with guaranteed delivery in ad hoc wireless networks
+Normal rank