{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:08:38Z","timestamp":1787504918768,"version":"build-2736575974"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0020-0190(03)00297-7","type":"journal-article","created":{"date-parts":[[2003,6,9]],"date-time":"2003-06-09T16:38:29Z","timestamp":1055176709000},"page":"271-275","source":"Crossref","is-referenced-by-count":7,"title":["On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle"],"prefix":"10.1016","volume":"87","author":[{"given":"SingLing","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hann-Jang","family":"Ho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0020-0190(03)00297-7_BIB001","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/12.589233","article-title":"Minimum-congestion hypergraph embedding in a cycle","volume":"46","author":"Ganley","year":"1997","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(03)00297-7_BIB002","first-page":"111","article-title":"A linear time algorithm for planner moat routing","volume":"10","author":"Tsai","year":"1994","journal-title":"J. Inform. Sci. Engrg."},{"key":"10.1016\/S0020-0190(03)00297-7_BIB003","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-9260(87)90017-4","article-title":"A bottom-up layout technique based on two-rectangle routing","volume":"5","author":"Sarrafzadeh","year":"1987","journal-title":"Integration: VLSI J."},{"key":"10.1016\/S0020-0190(03)00297-7_BIB004","series-title":"Proc. 6th Great Lakes Symp. VLSI","first-page":"86","article-title":"A provably good moat routing algorithm","author":"Ganley","year":"1996"},{"issue":"5","key":"10.1016\/S0020-0190(03)00297-7_BIB005","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0190(98)00117-3","article-title":"Improved approximation algorithms for embedding hyperedges in a cycle","volume":"67","author":"Gonzalez","year":"1998","journal-title":"Inform. Process. Lett."},{"issue":"11","key":"10.1016\/S0020-0190(03)00297-7_BIB006","doi-asserted-by":"crossref","first-page":"1310","DOI":"10.1109\/12.736445","article-title":"A simple approximation algorithm for two problems in circuit design","volume":"47","author":"Carpenter","year":"1998","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0020-0190(03)00297-7_BIB007","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0166-218X(92)90007-W","article-title":"Algorithms for routing around a rectangle","volume":"40","author":"Frank","year":"1992","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/S0020-0190(03)00297-7_BIB008","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1145\/48014.48018","article-title":"A linear time algorithm for optimal wiring around a rectangle","volume":"35","author":"Gonzalez","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(03)00297-7_BIB009","series-title":"Proc. 10th Internat. Symp. Algorithms and Computation","first-page":"367","article-title":"Approximating multicast congestion","author":"Vempala","year":"1999"},{"key":"10.1016\/S0020-0190(03)00297-7_BIB010","series-title":"Proc. 32th ACM Symp. Theory of Computing","first-page":"58","article-title":"Randomized metarounding","author":"Carr","year":"2000"},{"key":"10.1016\/S0020-0190(03)00297-7_BIB011","series-title":"Proc. 3rd Internat. Workshop Approximation and Randomized Algorithms in Communication Networks","article-title":"An approximation algorithm for the multicast congestion problem via minimum Steiner trees","author":"Jansen","year":"2002"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002977?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002977?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T18:02:17Z","timestamp":1553104937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0020019003002977"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00297-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}