Library

eCommons

 

A Faster, Better Approximation Algorithm for the Minimum Latency Problem

Simple item page
dc.contributor.authorArcher, A.en_US
dc.contributor.authorWilliamson, D. P.en_US
dc.contributor.authorLevin, A.en_US
dc.date.accessioned2007-11-09T21:00:35Z
dc.date.available2007-11-09T21:00:35Z
dc.date.issued2003-01en_US
dc.description.abstractA Faster, Better Approximation Algorithm for the Minimum Latency Problemen_US
dc.format.extent167477 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation1362en_US
dc.identifier.urihttps://hdl.handle.net/1813/9239
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.titleA Faster, Better Approximation Algorithm for the Minimum Latency Problemen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR001362.pdf
Size:
163.55 KB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports