The complexity of base station positioning in cellular networks (Q1775056): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2004.07.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2037456313
@@ Property / OpenAlex ID: W2037456313 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Optimum positioning of base stations for cellular radio networks
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank