@inproceedings{9099b2ade3184fe790d13ee3dbba1412,

title = "Geometric packing under non-uniform constraints",

abstract = "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 O(1)-approximation and prove that no PTAS is possible.",

keywords = "Independent set, Optimization, Rounding scheme",

author = "Alina Ene and Sariel Har-Peled and Benjamin Raichel",

year = "2012",

month = jul,

day = "23",

doi = "10.1145/2261250.2261253",

language = "English (US)",

isbn = "9781450312998",

series = "Proceedings of the Annual Symposium on Computational Geometry",

pages = "11--20",

booktitle = "Proceedings of the 28th Annual Symposuim on Computational Geometry, SCG 2012",

note = "28th Annual Symposuim on Computational Geometry, SCG 2012 ; Conference date: 17-06-2012 Through 20-06-2012",

}