The complexity of base station positioning in cellular networks
Authors:
- Christian GlaßerCGChristian Glaßer
- Steffen ReithSRSteffen Reith
- Heribert VollmerHVHeribert Vollmer
- 1 April 2005
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 148 (1) , 1-12
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985