Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DISK COVERING:
Reports tagged with Disk covering:
TR05-013 | 22nd December 2004
Bin Fu

#### Theory and Application of Width Bounded Geometric Separator

We introduce the notion of width bounded geometric separator,
develop the techniques for its existence as well as algorithm, and
apply it to obtain a $2^{O(\sqrt{n})}$ time exact algorithm for the
disk covering problem, which seeks to determine the minimal number
of fixed size disks to cover $n$ points on ... more >>>

ISSN 1433-8092 | Imprint