Sciweavers

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

9

FOCS
2007
IEEE

favoriteEmaildiscussreport

120views Theoretical Computer Science» more FOCS 2007»

Beating Simplex for Fractional Packing and Covering Linear Programs

13 years 6 months ago

Beating Simplex for Fractional Packing and Covering Linear Programs

Download www.cs.ucr.edu

Christos Koufogiannakis, Neal E. Young

Real-time Traffic

FOCS 2007 | Theoretical Computer Science |

claim paper

Related Content

» Distributed algorithms for covering packing and maximum weighted matching

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Christos Koufogiannakis, Neal E. Young

Comments (0)