On the complexity of locating linear facilities in the plane (Q1837617): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(82)90039-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2027402472
@@ Property / OpenAlex ID: W2027402472 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4131987
@@ Property / cites work: Q4131987 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5514221
@@ Property / cites work: Q5514221 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Least-Distances Lines
@@ Property / cites work: Finding Least-Distances Lines / rank @@
+Normal rank
@@ Property / cites work @@
+Q5669010
@@ Property / cites work: Q5669010 / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-Case and Probabilistic Analysis of a Geometric Location Problem
+Normal rank
@@ Property / DBLP publication ID @@
+journals/orl/MegiddoT82
@@ Property / DBLP publication ID: journals/orl/MegiddoT82 / rank @@
+Normal rank