Polynomial time approximation schemes for base station coverage with minimum total radii

DOI10.1016/J.COMNET.2004.08.012MaRDI QIDQ2484959zbMATH OpenOpenAlexFDO

Authors Nissan Lev-Tov, David Peleg

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

zbMATH Keywords

Wireless networksNetwork designBasestation placementDisk covering

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2089212
• Polynomial time approximation schemes for minimum disk cover problems
• Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
• Minimum-cost coverage of point sets by disks
• A note on multicovering with disks

Cited in

(46)

• Locating Facilities on a Network to Minimize Their Average Service Radius
• On Metric Clustering to Minimize the Sum of Radii
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION
• Algorithms for the line-constrained disk coverage and related problems
• Algorithms for the line-constrained disk coverage and related problems
• Some variations on constrained minimum enclosing circle problem
• Polynomial-time approximation schemes for piercing and covering with applications in wireless networks
• The Coverage Problem by Aligned Disks
• ``Green barrier coverage with mobile sensors
• Covering moving points with anchored disks
• Approximating fair \(k\)-min-sum-radii in Euclidean space
• ``Green barrier coverage with mobile sensors
• Faster algorithms for some optimization problems on collinear points
• Radar placement along banks of river
• Bounded-hop communication networks
• PTAS for minimum cost multicovering with disks
• Dynamic clustering to minimize the sum of radii
• A 1/2 approximation algorithm for energy-constrained geometric coverage problem
• On the line-separable unit-disk coverage and related problems
• Shifting strategy for geometric graphs without geometry
• On the bounded-hop range assignment problem
• The coverage problem by aligned disks
• Constant-approximation for prize-collecting min-sensor sweep coverage with base stations
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
• Online sum-radii clustering
• Multi cover of a polygon minimizing the sum of areas
• Multi cover of a polygon minimizing the sum of areas
• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems
• Energy-efficient user association in broadcast transmission
• Changing of the guards: strip cover with duty cycling
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties
• Range assignment of base-stations maximizing coverage area without interference
• Capacitated covering problems in geometric spaces
• Average case network lifetime on an interval with adjustable sensing ranges
• A PTAS for the disk cover problem of geometric objects
• Maximizing Barrier Coverage Lifetime with Static Sensors
• Fault-tolerant covering problems in metric spaces
• The bound coverage problem by aligned disks in \(L_1\) metric
• Capacitated covering problems in geometric spaces
• On metric clustering to minimize the sum of radii
• Set it and forget it: approximating the set once strip cover problem
• Dynamic clustering to minimize the sum of radii
• scientific article; zbMATH DE number 2089212 (Why is no real title available?)
• Maximizing barrier coverage lifetime with static sensors
• Judgement theorems and an approach for solving the constellation-to-ground coverage problem

This page was built for publication: Polynomial time approximation schemes for base station coverage with minimum total radii

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