Exact and approximation algorithms for geometric and capacitated set cover problems

DOI10.1007/978-3-642-14031-0_26MaRDI QIDQ3578321zbMATH OpenOpenAlexFDO

Authors Piotr Berman, Marek Karpinski, Andrzej Lingas

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)

Recommendations

• Exact and approximation algorithms for geometric and capacitated set cover problems
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
• Improved approximation algorithms for geometric set cover
• Improved approximation algorithms for geometric set cover
• Capacitated discrete unit disk cover

Cited in

(15)

• Improved approximation algorithms for geometric set cover
• scientific article; zbMATH DE number 7376034 (Why is no real title available?)
• Improved approximation algorithms for geometric set cover
• Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
• Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
• Exact and approximation algorithms for geometric and capacitated set cover problems
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Linear Time Approximation Schemes for Geometric Maximum Coverage
• Algorithms of optimal set covering on the planar R^2
• Geometric dominating-set and set-cover via local-search
• Capacitated covering problems in geometric spaces
• Capacitated covering problems in geometric spaces
• A PTAS for the cardinality constrained covering with unit balls
• Exact approaches for solving a covering problem with capacitated subtrees
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers

This page was built for publication: Exact and approximation algorithms for geometric and capacitated set cover problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578321)