1040 search results - page 59 / 208 » Rounding algorithms for covering problems |
105
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
108
click to vote
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
PDCN
2004
14 years 11 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
CCCG
2010
14 years 11 months ago
2010
We study the problem of finding optimal covers of polygonal regions using multiple mobile guards. By our definition, a point is covered if, at some time, it lies within the convex...