Sciweavers

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

9

STOC
2003
ACM

favoriteEmaildiscussreport

100views Algorithms» more STOC 2003»

Simpler and better approximation algorithms for network design

14 years 4 months ago

Simpler and better approximation algorithms for network design

Download www.cs.cornell.edu

Anupam Gupta, Amit Kumar, Tim Roughgarden

Real-time Traffic

Algorithms | Better Approximation Algorithms | STOC 2003 |

claim paper

Related Content

» Approximation via cost sharing Simpler and better approximation algorithms for network des...

» Better and Simpler Approximation Algorithms for the Stable Marriage Problem

» A simpler and better derandomization of an approximation algorithm for single source rento...

» A simpler and better design of error estimating coding

» Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problem...

» CostSharing Mechanisms for Network Design

» A simpler and more efficient deterministic scheme for finding frequent items over sliding ...

» An approximation algorithm for network design problems with downwardsmonotone demand funct...

» Better approximation algorithms for bin covering

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Anupam Gupta, Amit Kumar, Tim Roughgarden

Comments (0)