Sciweavers

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

7

APPROX
2006
Springer

favoriteEmaildiscussreport

72views Algorithms» more APPROX 2006»

An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

13 years 8 months ago

An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

Download www.cs.washington.edu

Benjamin E. Birnbaum, Kenneth J. Goldman

Real-time Traffic

Algorithms | APPROX 2006 |

claim paper

Related Content

» Analysis of Approximation Algorithms for kSet Cover Using FactorRevealing Linear Programs

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	APPROX
Authors	Benjamin E. Birnbaum, Kenneth J. Goldman

Comments (0)