Library

eCommons

 

Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts

Simple item page
dc.contributor.authorTardos, E.en_US
dc.contributor.authorKlein, P.en_US
dc.contributor.authorPlotkin, S.en_US
dc.contributor.authorStein, C.en_US
dc.date.accessioned2007-11-09T20:05:38Z
dc.date.available2007-11-09T20:05:38Z
dc.date.issued1991-02en_US
dc.description.abstractThis paper to appear in "IIE Transactions".en_US
dc.format.extent4013866 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation961en_US
dc.identifier.urihttps://hdl.handle.net/1813/8846
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleFaster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cutsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR000961.pdf
Size:
3.83 MB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports