On capacitated covering with unit balls

DOI10.1080/00207160.2014.959506zbMath1331.90065OpenAlexW2047978188MaRDI QIDQ5266149

Taha Ghasemi, Mohammadreza Razzazi

Publication date: 30 July 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.959506

zbMATH Keywords

computational geometrybin packinggeometric coveringcapacitated coveringconstant-factor approximation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Online unit clustering: Variations on a theme
• Optimal packing and covering in the plane are NP-complete
• Covering a set of points in multidimensional space
• Exact and approximation algorithms for clustering
• An analysis of the greedy algorithm for the submodular set covering problem
• Fast algorithms for bin packing
• Almost optimal set covers in finite VC-dimension
• On Capacitated Set Cover Problems
• Approximation schemes for covering and packing problems in image processing and VLSI
• How to Allocate Network Centers
• On Multidimensional Packing Problems
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Strip Packing vs. Bin Packing
• On Bin Packing with Conflicts
• Approximation of Partial Capacitated Vertex Cover

This page was built for publication: On capacitated covering with unit balls