Recommendations
- scientific article; zbMATH DE number 822101
- Capacitated covering problems in geometric spaces
- Capacitated covering problems in geometric spaces
- scientific article; zbMATH DE number 5032189
- On capacitated set cover problems
- Capacity and covering numbers
- A PTAS for the cardinality constrained covering with unit balls
- Covering Problems with Hard Capacities
- Capacitated discrete unit disk cover
- Capacitated discrete unit disk cover
Cites work
- Almost optimal set covers in finite VC-dimension
- An analysis of the greedy algorithm for the submodular set covering problem
- Approximation of Partial Capacitated Vertex Cover
- Approximation schemes for covering and packing problems in image processing and VLSI
- Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
- Covering a set of points in multidimensional space
- Exact and approximation algorithms for clustering
- Fast algorithms for bin packing
- How to Allocate Network Centers
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- Introduction to algorithms
- On Bin Packing with Conflicts
- On capacitated set cover problems
- On Multidimensional Packing Problems
- Online unit clustering: Variations on a theme
- Optimal packing and covering in the plane are NP-complete
- Strip Packing vs. Bin Packing
Cited in
(5)
This page was built for publication: On capacitated covering with unit balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266149)
