The complexity of base station positioning in cellular networks

DOI10.1016/j.dam.2004.07.005zbMath1099.90012OpenAlexW2037456313MaRDI QIDQ1775056

Christian Glaßer, Heribert Vollmer, Steffen Reith

Publication date: 4 May 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.07.005

zbMATH Keywords

ComplexityApproximation algorithmsPTASDemand NodeTraffic load model

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (3)

A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks ⋮ Radar placement along banks of river ⋮ Speeding up column generation for robust wireless network planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimum positioning of base stations for cellular radio networks
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Approximation schemes for covering and packing problems in image processing and VLSI

This page was built for publication: The complexity of base station positioning in cellular networks