Fault-tolerant covering problems in metric spaces

DOI10.1007/s00453-020-00762-yOpenAlexW3091469928MaRDI QIDQ2659766

Tanmay Inamdar, Santanu Bhowmick, Kasturi R. Varadarajan

Publication date: 26 March 2021

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00762-y

zbMATH Keywords

metric spacesapproximation algorithmsmulti-coveringfault-tolerant covering

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Related Items (5)

Constant-approximation for prize-collecting min-sensor sweep coverage with base stations ⋮ Approximation algorithms for the minimum power cover problem with submodular/linear penalties ⋮ Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks ⋮ A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem ⋮ A primal-dual algorithm for the minimum power partial cover problem

Cites Work

• Unnamed Item
• The \(p\)-neighbor \(k\)-center problem
• Fault tolerant \(K\)-center problems
• Clustering to minimize the sum of cluster diameters
• A note on multicovering with disks
• Polynomial time approximation schemes for base station coverage with minimum total radii
• On Clustering to Minimize the Sum of Radii
• A constant-factor approximation for multi-covering with disks
• Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
• A constant factor approximation algorithm for the fault-tolerant facility location problem
• Approximate Clustering via Metric Partitioning
• MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
• A Constant Factor Approximation Algorithm for Fault-Tolerant k -Median
• Fault-tolerant facility location
• A constant-factor approximation for multi-covering with disks
• Algorithms – ESA 2005
• Approximation and Online Algorithms

This page was built for publication: Fault-tolerant covering problems in metric spaces