Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

CCCG
2006

favoriteEmaildiscussreport

97views Computational Geometry» more CCCG 2006»

An Improved Approximation Factor For The Unit Disk Covering Problem

13 years 6 months ago

An Improved Approximation Factor For The Unit Disk Covering Problem

Download research.cs.queensu.ca

We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on the method used. This is an improvement on the best known approximation factor of 108.

Sada Narayanappa, Petr Vojtechovský

Real-time Traffic

Approximation Factor | CCCG 2006 | CCCG 2007 | Polynomial Time Algorithm | Possible Approximation Factor |

claim paper

Related Content

» ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...

» Polynomial time approximation schemes for minimum disk cover problems

» Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

» Practical Discrete Unit Disk Cover Using an Exact LineSeparable Algorithm

» Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

» A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

» Decomposing Coverings and the Planar Sensor Cover Problem

» Local Maximal Matching and Local 2Approximation for Vertex Cover in UDGs

» Improved Approximation Algorithms for Label Cover Problems

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	CCCG
Authors	Sada Narayanappa, Petr Vojtechovský

Comments (0)