Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Obnoxious facility location on graphs
SIAM Journal on Discrete Mathematics
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
A Survey on Obnoxious Facility Location Problems
A Survey on Obnoxious Facility Location Problems
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing
New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)
The Complexity of Combinatorial Optimization Problems on $d$-Dimensional Boxes
SIAM Journal on Discrete Mathematics
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Improved Results on Geometric Hitting Set Problems
Discrete & Computational Geometry
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
The Design of Approximation Algorithms
The Design of Approximation Algorithms
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
Geometric packing under non-uniform constraints
Proceedings of the twenty-eighth annual symposium on Computational geometry
Proceedings of the twenty-eighth annual symposium on Computational geometry
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity. We provide a general framework and an algorithm for approximating the optimal solution for packing in hypergraphs arising out of such geometric settings. Using this framework we get a flotilla of results on this problem (and also on its dual, where one wants to pick a maximum weight subset of the points when the regions have capacities). For example, for the case of fat triangles of similar size, we show an (1)-approximation and prove that no PTAS is possible. See [ehr-gpnuc-11] for the full version of the paper.