Approximation algorithms for a geometric set cover problem
type: Item
instance of: scholarly article
title: Approximation algorithms for a geometric set cover problem
zbMATH Open document ID: 1253.68358
author: Valentin E. Brimkov
author: Michael Mastroianni
author: Andrew Leach
author: Jimmy Wu
published in: Discrete Applied Mathematics
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 6039473
zbMATH Keywords: guarding set of segments
zbMATH Keywords: art-gallery problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: set cover
zbMATH Keywords: vertex cover
MaRDI profile type: Publication
full work available at URL: j.dam.2011.11.023
OpenAlex ID: W2049234398
cites work: Modem illumination of monotone polygons
cites work: Q2754182
cites work: Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
cites work: Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments
cites work: Guarding a set of line segments in the plane
cites work: Q4228484
cites work: Q4198056
cites work: Q5514221
cites work: Q4142699
cites work: Q5837707
cites work: On the ratio of optimal integral and fractional covers
cites work: On the hardness of approximating minimization problems
cites work: An Algorithm for a Minimum Cover of a Graph
cites work: Q3799261
cites work: Q4739657
cites work: Q4945523
DOI: 10.1016/J.DAM.2011.11.023
description: scientific article; zbMATH DE number 6039473