{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T07:13:22Z","timestamp":1672557202021},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":[[2000,11]]},"DOI":"10.1016\/s0020-0190(00)00128-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:14:57Z","timestamp":1027581297000},"page":"13-17","source":"Crossref","is-referenced-by-count":16,"title":["Parallel approximation algorithms for maximum weighted matching in general graphs"],"prefix":"10.1016","volume":"76","author":[{"given":"Ryuhei","family":"Uehara","sequence":"first","affiliation":[]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00128-9_ID001","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","article-title":"A survey of heuristics for the weighted matching problem","volume":"Vol. 13","author":"Avis","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(00)00128-9_ID002","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"Vol. 17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0020-0190(00)00128-9_ID003","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(93)90055-E","article-title":"Approximating matchings in parallel","volume":"Vol. 46","author":"Fischer","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00128-9_ID004","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"434","article-title":"Data structures for weighted matching and nearest common ancestors with linking","author":"Gabow","year":"1990"},{"issue":"1","key":"10.1016\/S0020-0190(00)00128-9_ID005","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/6462.6502","article-title":"Efficient algorithms for finding maximum matching in graphs","volume":"Vol. 18","author":"Galil","year":"1986","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0020-0190(00)00128-9_ID006","series-title":"Limits to Parallel Computation","author":"Greenlaw","year":"1995"},{"key":"10.1016\/S0020-0190(00)00128-9_ID007","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","article-title":"An improved parallel algorithm for maximal matching","volume":"Vol. 22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00128-9_ID008","series-title":"The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity","first-page":"69","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S0020-0190(00)00128-9_ID009","series-title":"The Handbook of Theoretical Computer Science, Vol. I: Algorithms and Complexity","first-page":"870","article-title":"Parallel algorithms for shared-memory machines","author":"Karp","year":"1990"},{"issue":"1","key":"10.1016\/S0020-0190(00)00128-9_ID010","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a perfect matching is in random NC","volume":"Vol. 6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(00)00128-9_ID011","series-title":"Fast Parallel Algorithms for Graph Matching Problems","author":"Karpinski","year":"1998"},{"key":"10.1016\/S0020-0190(00)00128-9_ID012","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0022-0000(92)90024-D","article-title":"The complexity of circuit value and network stability","volume":"Vol. 44","author":"Mayr","year":"1992","journal-title":"J. of Comput. System Sci."},{"key":"10.1016\/S0020-0190(00)00128-9_ID013","series-title":"STACS '99","first-page":"259","article-title":"Linear time 12-approximation algorithm for maximum weighted matching in general graphs","volume":"Vol. 1563","author":"Preis","year":"1999"},{"key":"10.1016\/S0020-0190(00)00128-9_ID014","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90022-3","article-title":"Approximation algorithms for weighted matching","volume":"Vol. 54","author":"Venkatesan","year":"1987","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:24:36Z","timestamp":1556749476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0020019000001289"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00128-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}