PTAS for minimum cost multicovering with disks

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Exact algorithms and APX-hardness results for geometric packing and covering problems
Improved results on geometric hitting set problems
Clustering to minimize the sum of cluster diameters
A note on multicovering with disks
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
Polynomial time approximation schemes for base station coverage with minimum total radii
Fault-tolerant covering problems in metric spaces
Polynomial-time approximation schemes for geometric graphs
Weighted geometric set cover via quasi-uniform sampling
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling
On the set multicover problem in geometric settings
WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
A constant-factor approximation for multi-covering with disks
A PTAS for the Weighted Unit Disk Cover Problem
Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Approximation schemes for covering and packing problems in image processing and VLSI
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
A constant-factor approximation for multi-covering with disks
Algorithms – ESA 2005
Approximation and Online Algorithms
Local search strikes again: PTAS for variants of geometric covering and packing
Approximation algorithms for the minimum power partial cover problem

This page was built for publication: PTAS for minimum cost multicovering with disks

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