Abstract

9224789 Salowe This project will investigate and implement algorithms for constructing minimal rectilinear Steiner trees. Research will focus on decomposition theorems for 3-connected and k-connected components. The strategies to be used include backtrack searching and full set enumeration. ***

  Funding Agency

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Type
Standard Grant (Standard)
Application #
9224789
Program Officer
S. Kamal Abdali
Project Start
Project End
Budget Start
1993-09-01
Budget End
1996-08-31
Support Year
Fiscal Year
1992
Total Cost
$60,000
Indirect Cost

  Institution

Name
University of Virginia
Department
Type
DUNS #
City
Charlottesville
State
VA
Country
United States
Zip Code
22904