{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T04:03:33Z","timestamp":1742270613662,"version":"3.40.1"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1109\/tpds.2005.62","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T16:00:23Z","timestamp":1115136023000},"page":"481-488","source":"Crossref","is-referenced-by-count":7,"title":["A 1.5 approximation algorithm for embedding hyperedges in a cycle"],"prefix":"10.1109","volume":"16","author":[{"family":"Sing Ling Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hann-Jang Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.589233"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0216046"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(87)90017-4"},{"key":"ref5","first-page":"86","article-title":"A Provably Good Moat Routing Algorithm","volume-title":"Proc. Sixth Great Lakes Symp. VLSI","author":"Ganley"},{"issue":"1","key":"ref6","first-page":"111","article-title":"A Linear Time Algorithm for Planner Moat Routing","volume":"10","author":"Tsai","year":"1994","journal-title":"J. Information Science Eng."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90007-W"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00117-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/12.736445"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46632-0_37"},{"key":"ref11","first-page":"58","article-title":"Randomized Metarounding","volume-title":"Proc. 32nd ACM Symp. Theory of Computing","author":"Carr"},{"article-title":"An Approximation Algorithm for the Multicast Congestion Problem via Minimum Steiner Trees","volume-title":"Proc. Third Int\u2019l Workshop Approximation and Randomized Algorithms in Comm. Networks","author":"Jansen","key":"ref12"},{"volume-title":"Integer Programming","year":"1998","author":"Wolsey","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02110141"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480195294994"},{"key":"ref16","first-page":"333","article-title":"Ring Routing and Wavelength Translation","volume-title":"Proc. Ninth Ann. ACM-SIAM Symp. Discrete Algorithms","author":"Wilfong"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/bltj.2047"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199358709"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx5\/71\/30780\/01425436.pdf?arnumber=1425436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T04:46:17Z","timestamp":1742186777000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/1425436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":18,"journal-issue":{"issue":"6"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/tpds.2005.62","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}