{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:05:09Z","timestamp":1780067109269,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540681052","type":"print"},{"value":"9783540681113","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68111-3_74","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T12:27:12Z","timestamp":1211977632000},"page":"708-717","source":"Crossref","is-referenced-by-count":30,"title":["A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem"],"prefix":"10.1007","author":[{"given":"Fredrik","family":"Manne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rob H.","family":"Bisseling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"74_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D. Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks\u00a013, 475\u2013493 (1983)","journal-title":"Networks"},{"key":"74_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198529392.001.0001","volume-title":"Parallel Scientific Computation: A Structured Approach Using BSP and MPI","author":"R.H. Bisseling","year":"2004","unstructured":"Bisseling, R.H.: Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford University Press, Oxford (2004)"},{"key":"74_CR3","unstructured":"Davis, T.: University of Florida sparse matrix collection. NA Digest 92(42) (October 16, 1994), NA Digest 96(28) (July 23, 1996), NA Digest 97(23) (June 7, 1997), \n                    \n                      http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices"},{"key":"74_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1077464.1077472","volume":"1","author":"D.E. Drake","year":"2005","unstructured":"Drake, D.E., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms\u00a01, 107\u2013122 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"74_CR5","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0895479897317661","volume":"20","author":"I.S. Duff","year":"1999","unstructured":"Duff, I.S., Koster, J.: The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J. Matrix Anal. Appl.\u00a020, 889\u2013901 (1999)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"74_CR6","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/S0895479899358443","volume":"22","author":"I.S. Duff","year":"2001","unstructured":"Duff, I.S., Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix. SIAM J. Matrix Anal. Appl.\u00a022, 973\u2013996 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"74_CR7","volume-title":"Introduction to Parallel Computing","author":"A. Grama","year":"2003","unstructured":"Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Reading (2003)","edition":"2"},{"key":"74_CR8","unstructured":"Hoepman, J.-H.: Simple distributed weighted matchings, arXiv:cs\/0410047v1 (2004)"},{"key":"74_CR9","unstructured":"Karypis, G., Kumar, V.: Metis, a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices. Version 4.0 (1998)"},{"key":"74_CR10","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput.\u00a015, 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"74_CR11","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ipl.2004.05.007","volume":"91","author":"S. Pettie","year":"2004","unstructured":"Pettie, S., Sanders, P.: A simpler linear time 2\/3\u2009\u2212\u2009\u03b5 approximation for maximum weight matching. Inf. Process. Lett.\u00a091, 271\u2013276 (2004)","journal-title":"Inf. Process. Lett."},{"key":"74_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R. Preis","year":"1999","unstructured":"Preis, R.: Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 259\u2013269. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68111-3_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:35:03Z","timestamp":1620002103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68111-3_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681052","9783540681113"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68111-3_74","relation":{},"subject":[]}}