Bicriteria approximation algorithms for the unit disk coverage problem

DOI10.1007/978-981-96-1090-7_5MaRDI QIDQ6970746zbMATH OpenFDO

Authors Xiya Zheng, Xiaofei Liu, Hao Zhang

Publication date 17 June 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1090-7_5

zbMATH Keywords

partitioning algorithmbicriteria approximation algorithmunit disk coverage problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 7788391 (Why is no real title available?)
• A note on the minimum power partial cover problem on the plane
• A primal-dual algorithm for the minimum power partial cover problem
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• Algorithms – ESA 2005
• An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
• An efficient algorithm for determining the convex hull of a finite planar set
• Approximation algorithm for minimum partial multi-cover under a geometric setting
• Approximation algorithms for the minimum power cover problem with submodular/linear penalties
• Approximation algorithms for the unit disk cover problem in 2D and 3D
• Capacitated covering problems in geometric spaces
• Improved bounds for metric capacitated covering problems
• Optimal coverage in wireless sensor networks
• Optimal packing and covering in the plane are NP-complete
• Unit disk cover problem in 2D

Cited in

(1)

• A PTAS for the budgeted power maximum coverage problem

This page was built for publication: Bicriteria approximation algorithms for the unit disk coverage problem

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