{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:40:59Z","timestamp":1746160859434,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icvd.2003.1183116","type":"proceedings-article","created":{"date-parts":[[2003,8,27]],"date-time":"2003-08-27T11:38:00Z","timestamp":1061984280000},"page":"64-69","source":"Crossref","is-referenced-by-count":4,"title":["An efficient practical heuristic for good ratio-cut partitioning"],"prefix":"10.1109","author":[{"given":"S.B.","family":"Patkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Submodular Functions and Electrical Networks Annals of Discrete Mathematics","year":"1997","author":"narayanan","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0047"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00472-9"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/43.103500","article-title":"An improved two-way partitioning algorithm with stable performance","volume":"10","author":"wei","year":"1991","journal-title":"IEEE Trans Computer Aided Design"},{"journal-title":"Submodular Functions and Optimization Annals of Discrete Mathematics 47","year":"1991","author":"fujishige","key":"ref4"},{"year":"0","key":"ref3","article-title":"GTL (A Graph Template Library)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21960"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/SFCS.1988.21958","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximate algorithms","author":"leighton","year":"1988","journal-title":"29th Symposium on the Foundations of Computer Science"},{"article-title":"METIS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices (version 4.0)","year":"1998","author":"karypis","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00083-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","author":"lengauer","year":"1990","journal-title":"Combinatorial Algorithms for Integrated Circuit Layout"}],"event":{"name":"16th International Conference on VLSI Design. Concurrently with the 2nd International Conference on Embedded Systems Design","acronym":"ICVD-03","location":"New Delhi, India"},"container-title":["16th International Conference on VLSI Design, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8427\/26547\/01183116.pdf?arnumber=1183116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T04:35:50Z","timestamp":1585110950000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1183116\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icvd.2003.1183116","relation":{},"subject":[]}}