{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T07:42:57Z","timestamp":1729669377802,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2002.1010491","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T16:42:54Z","timestamp":1056559374000},"page":"IV-457-IV-460","source":"Crossref","is-referenced-by-count":0,"title":["Efficient approximation algorithms for the maximum weight matching problem"],"prefix":"10.1109","volume":"4","author":[{"given":"D.","family":"Takafuji","sequence":"first","affiliation":[]},{"given":"S.","family":"Taoka","sequence":"additional","affiliation":[]},{"given":"T.","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321942"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","article-title":"inear Time 1\/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs","volume":"1563","author":"preis","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1978","author":"garey","key":"ref6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.3"},{"key":"ref8","first-page":"41","article-title":"A Heuristic Via minimization Algorithm for Two-Layer Routing","author":"miyata","year":"2000","journal-title":"Technical Report 99–12"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0204019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1983.1085357"},{"key":"ref9","first-page":"123","article-title":"Optimal Layer Assignment for Interconnect","volume":"1","author":"pinter","year":"1984","journal-title":"Journal of VLSI and Computer Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130404"}],"event":{"name":"2002 IEEE International Symposium on Circuits and Systems","acronym":"ISCAS-02","location":"Phoenix-Scottsdale, AZ, USA"},"container-title":["2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7897\/21779\/01010491.pdf?arnumber=1010491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:39:59Z","timestamp":1497551999000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1010491\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/iscas.2002.1010491","relation":{},"subject":[]}}