3 search results - page 1 / 1 » An Almost Linear Time 2.8334-Approximation Algorithm for the... |
AAIM
2007
Springer
13 years 10 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
SODA
2012
ACM
11 years 6 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
COLT
2003
Springer
13 years 9 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...