@inproceedings{d4fcd8927ba7499ab1a5be60bad5cea7,
title = "Steiner tree optimization for buffers. Blockages and bays",
abstract = "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.",
author = "Alpert, {Charles J.} and Gopal Gandham and Jiang Hu and Neves, {Jose L.} and Quay, {Stephen T.} and Sapatnekar, {Sachin S}",
year = "2001",
month = jan,
day = "1",
doi = "10.1109/iscas.2001.922069",
language = "English (US)",
isbn = "0780366859",
series = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",
publisher = "IEEE Computer Society",
pages = "399--402",
booktitle = "ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings",
note = "2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 ; Conference date: 06-05-2001 Through 09-05-2001",
}