Franceschetti, Massimo and Cook, Matthew and Bruck, Jehoshua (2001) A Geometric Theorem for Approximate Disk Covering Algorithms. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechPARADISE:2001.ETR035
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
See Usage Policy. 326Kb | |
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF (Adobe PDF (1.9MB))
See Usage Policy. 1851Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechPARADISE:2001.ETR035
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..
| Item Type: | Report or Paper (Technical Report) |
|---|---|
| Group: | Parallel and Distributed Systems Group |
| Record Number: | CaltechPARADISE:2001.ETR035 |
| Persistent URL: | http://resolver.caltech.edu/CaltechPARADISE:2001.ETR035 |
| Related URLs: | |
| Usage Policy: | You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format. |
| ID Code: | 26039 |
| Collection: | CaltechPARADISE |
| Deposited By: | Imported from CaltechPARADISE |
| Deposited On: | 03 Sep 2002 |
| Last Modified: | 26 Dec 2012 13:51 |
Repository Staff Only: item control page
