An improved approximation algorithm for the most points covering problem
type: Item
instance of: scholarly article
title: An improved approximation algorithm for the most points covering problem
zbMATH Open document ID: 1253.68148
author: Hossein Ghasemalizadeh
author: Mohammadreza Razzazi
published in: Theory of Computing Systems
publication date: 2012-12-06T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6113528
zbMATH Keywords: geometric covering
zbMATH Keywords: most points covering
zbMATH Keywords: partial covering
zbMATH Keywords: approximation algorithm
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: s00224-011-9353-4
OpenAlex ID: W2036721110
cites work: Improved approximation algorithms for geometric set cover
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Theory and Application of Width Bounded Geometric Separator
cites work: A threshold of ln n for approximating set cover
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Covering a set of points in multidimensional space
cites work: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
cites work: Approximation algorithms for partial covering problems
cites work: The budgeted maximum coverage problem
cites work: On a circle placement problem
cites work: Covering many or few points with unit disks
cites work: Exact and approximation algorithms for clustering
cites work: Introduction to algorithms
DOI: 10.1007/S00224-011-9353-4
description: scientific article; zbMATH DE number 6113528