Polynomial time approximation schemes for base station coverage with minimum total radii
From MaRDI portal
Publication:2484959
DOI10.1016/j.comnet.2004.08.012zbMath1079.68505OpenAlexW1974383230MaRDI QIDQ2484959
Publication date: 3 August 2005
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comnet.2004.08.012
Network design and communication in computer systems (68M10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (39)
On the Bounded-Hop Range Assignment Problem ⋮ A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems ⋮ Maximizing Barrier Coverage Lifetime with Static Sensors ⋮ Fault-tolerant covering problems in metric spaces ⋮ Connectivity graphs of uncertainty regions ⋮ Set it and forget it: approximating the set once strip cover problem ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Approximation algorithms for the minimum power cover problem with submodular/linear penalties ⋮ Capacitated covering problems in geometric spaces ⋮ Changing of the guards: strip cover with duty cycling ⋮ The bound coverage problem by aligned disks in \(L_1\) metric ⋮ Covering moving points with anchored disks ⋮ The Coverage Problem by Aligned Disks ⋮ On Metric Clustering to Minimize the Sum of Radii ⋮ Some variations on constrained minimum enclosing circle problem ⋮ Connecting a set of circles with minimum sum of radii ⋮ Radar placement along banks of river ⋮ The coverage problem by aligned disks ⋮ Energy-Efficient User Association in Broadcast Transmission ⋮ Dynamic clustering to minimize the sum of radii ⋮ VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION ⋮ Shifting strategy for geometric graphs without geometry ⋮ A PTAS for the disk cover problem of geometric objects ⋮ Locating Facilities on a Network to Minimize Their Average Service Radius ⋮ Online sum-radii clustering ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS ⋮ Polynomial-time approximation schemes for piercing and covering with applications in wireless networks ⋮ Bounded-hop communication networks ⋮ ``Green barrier coverage with mobile sensors ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ On metric clustering to minimize the sum of radii ⋮ Unnamed Item ⋮ Multi Cover of a Polygon Minimizing the Sum of Areas ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks ⋮ Unnamed Item ⋮ Capacitated Covering Problems in Geometric Spaces ⋮ Maximizing barrier coverage lifetime with static sensors ⋮ Average case network lifetime on an interval with adjustable sensing ranges
This page was built for publication: Polynomial time approximation schemes for base station coverage with minimum total radii
