Steiner tree optimization for buffers. Blockages and bays Conference Paper uri icon


  • Buffer insertion is essential for achieving timing closure. This work studies buffer insertion under two types of constraints: (i) avoiding blockages, and (ii) inserting buffers into pre-determined buffer bay regions. We propose a general Steiner tree routing problem to drive this application and present a maze-routing based heuristic. We show that this approach leads to useful solutions on industry designs. 2001 IEEE.

published proceedings

  • ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

author list (cited authors)

  • Alpert, C. J., Gandham, G., Hu, J., Neves, J. L., Quay, S. T., & Sapatnekar, S. S.

complete list of authors

  • Alpert, CJ||Gandham, G||Hu, J||Neves, JL||Quay, ST||Sapatnekar, SS

publication date

  • January 2001