An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem

DOI10.1007/978-3-540-72870-2_30zbMath1137.68610OpenAlexW1501749075MaRDI QIDQ5434450

Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72870-2_30

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (4)

A PTAS for the cardinality constrained covering with unit balls ⋮ Approximation algorithms for the unit disk cover problem in 2D and 3D ⋮ An improved approximation algorithm for the most points covering problem ⋮ Experiments with unit disk cover algorithms for covering massive pointsets

This page was built for publication: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem