Fast approximation algorithms for multicommodity flow problems
By: by T. Leighton ... [et al.].
Contributors: Leighton, T.
Series: Report ;; STAN-CS-91-1375; Report (Stanford University. Computer Science Dept.) ;; no. STAN-CS-91-1375.
Publisher: Dept. of Computer Science, Stanford University
Published: 1991
Place of publication: Stanford, Calif
Language: eng
Number of pages: 25
Subjects: Network analysis (Planning); Approximation theory.; Programming (Mathematics)
Notes: Includes bibliographical references (p. 24-25).
Cover title.
"August 1991."