Published January 1, 2001
| public
Report
Open
A Geometric Theorem for Approximate Disk Covering Algorithms
Abstract
We present a basic theorem in combinatorial geometry that leads to a family of approximation algorithms for the the geometric disk covering problem. These algorithms exhibit constant approximation factors, with a wide range of their choices. This flexibility allows to achieve a running time that compares favourably with those of existing procedures..
Files
etr035.pdf
Files
(2.2 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:fdb4840f55c9da38b3f9ae882f39647c
|
1.9 MB | Preview Download |
|
md5:3bc55da14a7a11f30f516b5c5d074d39
|
334.7 kB | Download |
Additional details
- Eprint ID
- 26039
- Resolver ID
- CaltechPARADISE:2001.ETR035
- Created
-
2002-09-03Created from EPrint's datestamp field
- Updated
-
2019-11-22Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group