Sciweavers

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

111

Voted

WG
2007
Springer

87views Theoretical Computer Science» more WG 2007»

Approximation Algorithms for Geometric Intersection Graphs

15 years 8 months ago

Approximation Algorithms for Geometric Intersection Graphs

Download www.cs.le.ac.uk

Klaus Jansen

Real-time Traffic

Computer Science | WG 2007 |

claim paper

Related Content

» Densest kSubgraph Approximation on Intersection Graphs

» Spanners for Geometric Intersection Graphs

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

» Shifting Strategy for Geometric Graphs without Geometry

» Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs

» A PolynomialTime Approximation Algorithm for a Geometric Dispersion Problem

» Uncertain Geometry in Computer Vision

» Sublinear geometric algorithms

» Approximating the minimum clique cover and other hard problems in subtree filament graphs

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WG
Authors	Klaus Jansen

Comments (0)