A Caltech Library Service

A Geometric Theorem for Approximate Disk Covering Algorithms

Franceschetti, Massimo and Cook, Matthew and Bruck, Jehoshua (2001) A Geometric Theorem for Approximate Disk Covering Algorithms. California Institute of Technology . (Unpublished)

See Usage Policy.

PDF (Adobe PDF (1.9MB))
See Usage Policy.


Use this Persistent URL to link to this item:


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)
Related URLs:
URLURL TypeDescription
Group:Parallel and Distributed Systems Group
Record Number:CaltechPARADISE:2001.ETR035
Persistent URL:
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
Deposited By: Imported from CaltechPARADISE
Deposited On:03 Sep 2002
Last Modified:26 Dec 2012 13:51

Repository Staff Only: item control page