The complexity of base station positioning in cellular networks (Q1775056): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4258216 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4228484 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum positioning of base stations for cellular radio networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3221403 / rank | |||
Normal rank | |||
Latest revision as of 11:03, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of base station positioning in cellular networks |
scientific article |
Statements
The complexity of base station positioning in cellular networks (English)
0 references
4 May 2005
0 references
Complexity
0 references
Approximation algorithms
0 references
PTAS
0 references
Demand Node
0 references
Traffic load model
0 references
0 references
