AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS
DOI10.1142/S0129054114500257zbMath1302.68287MaRDI QIDQ2929639
Mohammadreza Razzazi, Taha Ghasemi, Hossein Ghasemalizadeh
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
approximation algorithmcomputational geometrygeometric coveringset cover problemalgorithmic frameworkcovering with diskscovering with obstaclescovering with sectors
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation algorithms (68W25)
Cites Work
- Improved results on geometric hitting set problems
- An improved approximation algorithm for the most points covering problem
- Improved approximation algorithms for geometric set cover
- The multi-facility location-allocation problem with polyhedral barriers
- On a circle placement problem
- Covering a set of points in multidimensional space
- Generalized submodular cover problems and applications
- Exact and approximation algorithms for clustering
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- An analysis of the greedy algorithm for the submodular set covering problem
- Almost optimal set covers in finite VC-dimension
- The 2-Center Problem with Obstacles
- A threshold of ln n for approximating set cover
- Covering Problems with Hard Capacities
- AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
- Approximation schemes for covering and packing problems in image processing and VLSI
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Approximation algorithms for partial covering problems
This page was built for publication: AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS
