Computational problems in network design and analysis are addressed. Since standard approaches to finding exact solutions to these problems are time consuming, the focus is on the development of new approximation and parallel algorithms. Multi-commodity flow is used as a tool to formulate and solve network problems.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9157620
Program Officer
Yechezkel Zalcstein
Project Start
Project End
Budget Start
1991-07-15
Budget End
1996-12-31
Support Year
Fiscal Year
1991
Total Cost
$320,178
Indirect Cost
Name
Brown University
Department
Type
DUNS #
City
Providence
State
RI
Country
United States
Zip Code
02912