Massachusetts AND SATISH RAO NEC Research Institute / Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology / Massachusetts Institute of Technology / University of California / Soda Hall / /
IndustryTerm
polynomial-time approximation algorithms / polynomial-time algorithms / approximation algorithm / divideand-conquer-based algorithms / important applications / sparse linear systems / polynomial-time algorithm / search number / polynomial time approximation algorithms / nontrivial polynomial-time approximation algorithms / substantial applications / arbitrary underlying networks / scientific computing / approximation algorithms / /
Organization
Computer Science Division / Department of Mathematics and Laboratory for Computer Science / University of California / Berkeley / Massachusetts Institute of Technology / SATISH RAO NEC Research Institute / Association for Computing Machinery / /
Person
Max-Flow Min-Cut / MIN-CUTS FOR MULTICOMMODITY / Awerbuch / Max-Flow Min-Cut Theorems / TOM LEIGHTON / /
Position
Problems General / representative / /
ProvinceOrState
New Jersey / California / Massachusetts / /
PublishedMedium
Journal of the ACM / /
Technology
known polynomial-time algorithms / polynomial-time approximation algorithms / nontrivial polynomial-time approximation algorithms / approximation algorithm / polynomial-time algorithms / polynomial-time algorithm / approximation algorithms / divideand-conquer-based algorithms / Designing Approximation Algorithms / polynomial time approximation algorithms / Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology / /
Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms TOM LEIGHTON Massachusetts Institute of Technology, Cambridge, Massachusetts AND