Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems

DOI10.1007/978-3-642-14031-0_26zbMath1286.68461OpenAlexW2131826580MaRDI QIDQ3578321

Piotr Berman, Andrzej Lingas, Marek Karpinski

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_26

Mathematics Subject Classification ID

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

Related Items (1)

A PTAS for the cardinality constrained covering with unit balls

This page was built for publication: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems