Pages that link to "Item:Q2484959"

The following pages link to Polynomial time approximation schemes for base station coverage with minimum total radii (Q2484959):

Displaying 46 items.

• Covering moving points with anchored disks (Q421753) (← links)
• Radar placement along banks of river (Q427395) (← links)
• Shifting strategy for geometric graphs without geometry (Q454249) (← links)
• Changing of the guards: strip cover with duty cycling (Q896691) (← links)
• On metric clustering to minimize the sum of radii (Q970610) (← links)
• Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
• Judgement theorems and an approach for solving the constellation-to-ground coverage problem (Q1721028) (← links)
• Bounded-hop communication networks (Q1755730) (← links)
• Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
• ``Green'' barrier coverage with mobile sensors (Q1998844) (← links)
• Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
• Maximizing barrier coverage lifetime with static sensors (Q2093181) (← links)
• Constant-approximation for prize-collecting min-sensor sweep coverage with base stations (Q2151357) (← links)
• Capacitated covering problems in geometric spaces (Q2189730) (← links)
• Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
• Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
• Average case network lifetime on an interval with adjustable sensing ranges (Q2345943) (← links)
• A mixed breadth-depth first strategy for the branch and bound tree of Euclidean \(k\)-center problems (Q2377164) (← links)
• Connectivity graphs of uncertainty regions (Q2408099) (← links)
• Set it and forget it: approximating the set once strip cover problem (Q2408917) (← links)
• A PTAS for the disk cover problem of geometric objects (Q2450711) (← links)
• Online sum-radii clustering (Q2453160) (← links)
• Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
• Fault-tolerant covering problems in metric spaces (Q2659766) (← links)
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
• The coverage problem by aligned disks (Q2695288) (← links)
• Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons (Q2802931) (← links)
• “Green” Barrier Coverage with Mobile Sensors (Q2947008) (← links)
• Multi Cover of a Polygon Minimizing the Sum of Areas (Q3078391) (← links)
• On the Bounded-Hop Range Assignment Problem (Q3449812) (← links)
• On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION (Q3526982) (← links)
• Energy-Efficient User Association in Broadcast Transmission (Q4607277) (← links)
• MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS (Q4650087) (← links)
• Maximizing Barrier Coverage Lifetime with Static Sensors (Q5056063) (← links)
• (Q5111737) (← links)
• Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
• Faster algorithms for some optimization problems on collinear points (Q5115775) (← links)
• Locating Facilities on a Network to Minimize Their Average Service Radius (Q5387793) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
• The Coverage Problem by Aligned Disks (Q6173214) (← links)
• A 1/2 approximation algorithm for energy-constrained geometric coverage problem (Q6535282) (← links)
• Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)
• PTAS for minimum cost multicovering with disks (Q6593767) (← links)
• On the line-separable unit-disk coverage and related problems (Q6600812) (← links)