Exact and approximation algorithms for geometric and capacitated set cover problems

DOI10.1007/978-3-642-14031-0_26zbMATH Open1286.68461OpenAlexW2131826580MaRDI QIDQ3578321FDOQ3578321

Andrzej Lingas, Piotr Berman, 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

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

Mathematics Subject Classification ID

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

Cited In (11)

• Improved approximation algorithms for geometric set cover
• Title not available (Why is that?)
• Improved approximation algorithms for geometric set cover
• Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching
• Linear Time Approximation Schemes for Geometric Maximum Coverage
• Algorithms of optimal set covering on the planar R^2
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• Geometric dominating-set and set-cover via local-search
• A PTAS for the cardinality constrained covering with unit balls
• Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
• Exact approaches for solving a covering problem with capacitated subtrees

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)