1040 search results - page 65 / 208 » Rounding algorithms for covering problems |
AUSAI
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. Ant Colony Optimization (ACO) is a collection of metaheuristics inspired by foraging in ant colonies, whose aim is to solve combinatorial optimization problems. We identi...
120
click to vote
ICUMT
2009
14 years 7 months ago
2009
In WSN-based surveillance systems power conservation is an important issue but one must also ensure that the application's objectives are met. In this paper, we jointly addres...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
We consider the fundamental problem of waking up n processors sharing a multiple access channel. We assume the weakest model of synchronization, the locally synchronous model, in ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...