Exact algorithms and approximation schemes for base station placement problems

DOI10.1007/3-540-45471-3_10MaRDI QIDQ3046481zbMATH OpenFDO

Authors Nissan Lev-Tov, David Peleg

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680090.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Polynomial time approximation schemes for base station coverage with minimum total radii
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• Range assignment of base-stations maximizing coverage area without interference
• Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
• The complexity of base station positioning in cellular networks

Cited in

(15)

• Bounded-hop communication networks
• Range assignment of base-stations maximizing coverage area without interference
• On a class of covering problems with variable capacities in wireless networks
• Polynomial time approximation schemes for base station coverage with minimum total radii
• Station layouts in the presence of location constraints. (Extended abstract)
• On the bounded-hop range assignment problem
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• Base station placement on boundary of a convex polygon
• Tabu Search Heuristic for Competitive Base Station Location Problem
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
• Distributed Computing – IWDC 2005
• Approximation and Online Algorithms
• On a class of covering problems with variable capacities in wireless networks
• A couple of simple algorithms for k-dispersion
• Efficient algorithm for placing a given number of base stations to cover a convex region

This page was built for publication: Exact algorithms and approximation schemes for base station placement problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046481)