DEPARTMENT AND OF ELECTRICAL COMPUTER The Technological Institute Northwestern University Evanston, IL 60208 ENGINEERING SCIENCE TEL: (312) 491-7378 FAX." (312) 491-4133 mafid@ e¢c,. nw,. ~d, November 14, 1989 SIGDA, Travel Grants Dear Travel Grant Committee: I would like to thank you for providing me with a travel grant to attend ICCAD-89. I presented a paper entitled "A Powerful Global Router: Based on Steiner Min-Max Trees" oint work with C. Chiang and C.K. Wont). We proposed a novel formulation of the teiner tree problem, called Steiner min-max trees. This is the first class of efficiently solvable Steiner tree problem, in general graphs. An effective global router, based on Stelner min-max trees, were proposed. I enjoyed the conference. It was a unique opportunity to discuss both theoretical and practical aspects of VLSI layout. Researchers and designers are trying to integrate their expertise in mathematical analysis and implementation to attack complex problems. ⢠With best regards, j. /°Zt M. Sarrafzadeh Assistant Professor SIGDA Newsletter, vol 20, number 1 Computer Science Department University of Minnesota E E / C s c i 4-196 M i n n e a p o l i s , M i n n e s o
/lp/association-for-computing-machinery/department-of-electrical-engineering-and-computer-science-KVNwCLjKP4