AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS

DOI10.1142/S0129054114500257zbMath1302.68287MaRDI QIDQ2929639

Mohammadreza Razzazi, Hossein Ghasemalizadeh, Taha Ghasemi

Publication date: 14 November 2014

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

zbMATH Keywords

approximation algorithm; computational geometry; geometric covering; set cover problem; algorithmic framework; covering with disks; covering with obstacles; covering with sectors

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

68W25: Approximation algorithms