Sciweavers

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

68

Voted

WG
2005
Springer

favoriteEmaildiscussreport

97views Theoretical Computer Science» more WG 2005»

Approximation Algorithms for Unit Disk Graphs

15 years 2 months ago

Approximation Algorithms for Unit Disk Graphs

Download www.cs.uu.nl

Erik Jan van Leeuwen

Real-time Traffic

Computer Science | WG 2005 |

claim paper

Related Content

» A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

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

» Unit disk graph approximation

» The Expected Size of the Rule k Dominating Set

» 3d local algorithm for dominating sets of unit disk graphs

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

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» 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

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WG
Authors	Erik Jan van Leeuwen

Comments (0)