Exact and approximation algorithms for geometric and capacitated set cover problems
type: Item
instance of: scholarly article
title: Exact and approximation algorithms for geometric and capacitated set cover problems
zbMATH Open document ID: 1252.68347
author: Piotr Berman
author: Andrzej Lingas
author: Marek Karpinski
published in: Algorithmica
publication date: 2012-11-21T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6109322
zbMATH Keywords: set cover
zbMATH Keywords: geometric set cover
zbMATH Keywords: capacitated set cover
zbMATH Keywords: assignment of directional antenna
zbMATH Keywords: shipping with deadlines
zbMATH Keywords: approximation algorithms
zbMATH Keywords: polynomial-time approximation scheme
zbMATH Keywords: APX-hardness
zbMATH Keywords: exact algorithms
zbMATH Keywords: time complexity
MaRDI profile type: Publication
full work available at URL: s00453-011-9591-5
OpenAlex ID: W2794433803
cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
cites work: Almost optimal set covers in finite VC-dimension
cites work: Improved approximation algorithms for geometric set cover
cites work: Q3619797
cites work: Resource constrained scheduling as generalized bin packing
cites work: Q4198056
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: An efficient fully polynomial approximation scheme for the Subset-Sum problem.
DOI: 10.1007/S00453-011-9591-5
description: scientific article; zbMATH DE number 6109322