Author:
Mukherjee Shyamapada,Patra Jibesh,Roy Suchismita
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Ispd 1998 benchmark suite (1998),
http://cseweb.ucsd.edu/~kastner/research/labyrinth/
2. Ispd 2007 benchmark suite (2007),
http://archive.sigda.org/ispd2007/
3. Ispd 2008 benchmark suite (2008),
http://archive.sigda.org/ispd2008/
4. Lee, C.Y.: An algorithm for path connections and its applications. IRE Transactions on Electronic Computers EC-10(3), 346–365 (1961)
5. Alpert, C.J., Hrkić, M., Hu, J., Kahng, A.B., Lillis, J., Liu, B., Quay, S.T., Sapatnekar, S.S., Sullivan, A.J., Villarrubia, P.: Buffered steiner trees for difficult instances. In: Proceedings of the 2001 International Symposium on Physical Design, ISPD 2001, pp. 4–9. ACM, New York (2001)