Sciweavers

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

18

SODA
2000
ACM

favoriteEmaildiscussreport

78views Algorithms» more SODA 2000»

Strengthening integrality gaps for capacitated network design and covering problems

14 years 10 days ago

Strengthening integrality gaps for capacitated network design and covering problems

Download www.aladdin.cs.cmu.edu

Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cy

Real-time Traffic

Algorithms | SODA 2000 |

claim paper

Related Content

» The network inhibition problem

» Approximating rooted Steiner networks

» Truthful Unsplittable Flow for Large Capacity Networks

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	SODA
Authors	Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cynthia A. Phillips

Comments (0)