scientific article
From MaRDI portal
Publication:3601572
zbMath1153.90478MaRDI QIDQ3601572
Sándor P. Fekete, Christian Knauer, Helmut Alt, Jonathan Lechner, Hervé Brönnimann, Esther M. Arkin, Jeff Erickson, Kim Whittlesey, Joseph S. B. Mitchell
Publication date: 10 February 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items (36)
On the Bounded-Hop Range Assignment Problem ⋮ A Scheme for Computing Minimum Covers within Simple Regions ⋮ Fault-tolerant covering problems in metric spaces ⋮ Connectivity graphs of uncertainty regions ⋮ Approximation algorithms for the minimum power cover problem with submodular/linear penalties ⋮ The bound coverage problem by aligned disks in \(L_1\) metric ⋮ Geometric hitting set for line-constrained disks ⋮ An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ Energy-constrained geometric coverage problem ⋮ The Coverage Problem by Aligned Disks ⋮ A scheme for computing minimum covers within simple regions ⋮ 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 ⋮ A PTAS for the cardinality constrained covering with unit balls ⋮ Minimum covering with travel cost ⋮ A note on minimum-sum coverage by aligned disks ⋮ Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane ⋮ A PTAS for the disk cover problem of geometric objects ⋮ Locating Facilities on a Network to Minimize Their Average Service Radius ⋮ On the hardness of range assignment problems ⋮ Algorithms for the line-constrained disk coverage and related problems ⋮ Bounded-hop communication networks ⋮ Covering a line segment with variable radius discs ⋮ 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 ⋮ A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ Average case network lifetime on an interval with adjustable sensing ranges
Uses Software
This page was built for publication:
