1486 search results - page 48 / 298 » Algorithms for two-box covering |
142
Voted
DCOSS
2010
Springer
15 years 3 months ago
2010
Springer
Synchronization is widely considered as an important service in distributed systems which may simplify protocol design. Phase clock is a general synchronization tool that provides ...
127
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
128
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
115
Voted
ALGORITHMICA
2010
15 years 3 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
108
Voted
COMBINATORICS
2000
15 years 3 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...