18 search results - page 4 / 4 » Approximating Minimum Power Covers of Intersecting Families ... |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...