Multi Cover of a Polygon Minimizing the Sum of Areas

DOI10.1007/978-3-642-19094-0_15zbMath1317.68268OpenAlexW1486110677MaRDI QIDQ3078391

Gila Morgenstern, Paz Carmi, A. Karim Abu-Affash, Matthew J. Katz

Publication date: 20 February 2011

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Minimum power partial multi-cover on a line ⋮ A PTAS for the disk cover problem of geometric objects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On metric clustering to minimize the sum of radii
• Ray shooting in polygons using geodesic triangulations
• Clustering to minimize the sum of cluster diameters
• Polynomial time approximation schemes for base station coverage with minimum total radii
• WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
• A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
• On the hardness of approximating minimization problems
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• On the set multi-cover problem in geometric settings
• Algorithms – ESA 2005
• Approximation and Online Algorithms

This page was built for publication: Multi Cover of a Polygon Minimizing the Sum of Areas