Sciweavers

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

20

COMPGEOM
2009
ACM

favoriteEmaildiscussreport

134views Discrete Geometry» more COMPGEOM 2009»

Approximation algorithms for maximum independent set of pseudo-disks

14 years 5 months ago

Approximation algorithms for maximum independent set of pseudo-disks

Download valis.cs.uiuc.edu

Timothy M. Chan, Sariel Har-Peled

Real-time Traffic

COMPGEOM 2009 | Discrete Geometry |

claim paper

Related Content

» Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

» Approximating coloring and maximum independent sets in 3uniform hypergraphs

» Maximum Independent Set of Links under Physical Interference Model

» PTAS for maximum weight independent set problem with random weights in bounded degree grap...

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

» SDPBased Algorithms for Maximum Independent Set Problems on Hypergraphs

» Improved Approximations of Independent Sets in BoundedDegree Graphs

» Approximation Algorithms for the Weighted Independent Set Problem

» Finding a Maximum Independent Set in a Sparse Random Graph

Post Info
More Details (n/a)

Added	28 May 2010
Updated	28 May 2010
Type	Conference
Year	2009
Where	COMPGEOM
Authors	Timothy M. Chan, Sariel Har-Peled

Comments (0)