Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0005
Thomas Lengauer, Martin Lügering
Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT Global routing is an essential phase during the process of physical design of integrated circuits. Combinatorially, this problem amounts to a set of interdependent Steiner tree problems. Several versions of the problem are of importance in practical applications. All of them can be formulated as integer programs. Several such formulations have been investigated in the past, and diierent solution methods have been developed for diierent formulations. In this paper we give an overview of integer program formulations of the global routing problem and their solution methods, and we introduce new concepts for solving this important combinatorial problem. Finally, we present integer program formulations that integrate placement with global routing.
{"title":"Integer Program formulations of Global Routing and Placement Problems","authors":"Thomas Lengauer, Martin Lügering","doi":"10.1142/9789812794468_0005","DOIUrl":"https://doi.org/10.1142/9789812794468_0005","url":null,"abstract":"Received (received date) Revised (revised date) Communicated by (Name of Editor) ABSTRACT Global routing is an essential phase during the process of physical design of integrated circuits. Combinatorially, this problem amounts to a set of interdependent Steiner tree problems. Several versions of the problem are of importance in practical applications. All of them can be formulated as integer programs. Several such formulations have been investigated in the past, and diierent solution methods have been developed for diierent formulations. In this paper we give an overview of integer program formulations of the global routing problem and their solution methods, and we introduce new concepts for solving this important combinatorial problem. Finally, we present integer program formulations that integrate placement with global routing.","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131207767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0014
T. Gonzalez, Sing-Ling Lee
{"title":"Routing around two Rectangles to minimize the Layout Area","authors":"T. Gonzalez, Sing-Ling Lee","doi":"10.1142/9789812794468_0014","DOIUrl":"https://doi.org/10.1142/9789812794468_0014","url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131998249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0011
S. Tsukiyama, Keiichi Koike, I. Shirakawa
{"title":"An Algorithm to Eliminate All Complex Triangles in a Maximal Planar Graph for Use in VLSI floorplan","authors":"S. Tsukiyama, Keiichi Koike, I. Shirakawa","doi":"10.1142/9789812794468_0011","DOIUrl":"https://doi.org/10.1142/9789812794468_0011","url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114923329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0008
D. Zhou, F. Preparata
{"title":"On the Manhattan and knock-knee Routing Models","authors":"D. Zhou, F. Preparata","doi":"10.1142/9789812794468_0008","DOIUrl":"https://doi.org/10.1142/9789812794468_0008","url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114703993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0004
F. Makedon, S. Tragoudas
{"title":"Approximate solutions for Graph and Hypergraph Partitioning","authors":"F. Makedon, S. Tragoudas","doi":"10.1142/9789812794468_0004","DOIUrl":"https://doi.org/10.1142/9789812794468_0004","url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129532924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0006
T. Asano, T. Tokuyama
{"title":"Circuit Partitioning Algorithms based on Geometry Model","authors":"T. Asano, T. Tokuyama","doi":"10.1142/9789812794468_0006","DOIUrl":"https://doi.org/10.1142/9789812794468_0006","url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125274904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1142/9789812794468_0002
S. M. Kang, M. Sriram
{"title":"Binary formulations for Placement and Routing Problems","authors":"S. M. Kang, M. Sriram","doi":"10.1142/9789812794468_0002","DOIUrl":"https://doi.org/10.1142/9789812794468_0002","url":null,"abstract":"","PeriodicalId":145557,"journal":{"name":"Algorithmic Aspects of VLSI Layout","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123542805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：