{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:32:32Z","timestamp":1753522352909},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_2","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"14-23","source":"Crossref","is-referenced-by-count":13,"title":["Improved Linear Time Approximation Algorithms for Weighted Matchings"],"prefix":"10.1007","author":[{"given":"Doratha E.","family":"Drake","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Hougardy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_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":"2_CR2","first-page":"17","volume-title":"Proc. 7th Colloquium on Structural Information and Communication Complexity","author":"R. Beier","year":"2000","unstructured":"Beier, R., Sibeyn, J.F.: A Powerful Heuristic for Telephone Gossiping. In: Proc. 7th Colloquium on Structural Information and Communication Complexity, pp. 17\u201335. Carleton Scientific, Ottawa (2000)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0020-0190(02)00393-9","volume":"85","author":"D.E. Drake","year":"2003","unstructured":"Drake, D.E., Hougardy, S.: A Simple Approximation Algorithm for the Weighted Matching Problem. Information Processing Letters\u00a085, 211\u2013213 (2003)","journal-title":"Information Processing Letters"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards\u00a069B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"2_CR5","unstructured":"Fr\u00f6mmel, C., Gille, C., Goede, A., Gr\u00f6pl, C., Hougardy, S., Nierhoff, T., Prei\u00dfner, R., Thimm, M.: Accelerating screening of 3D protein data with a graph theoretical approach. To appear in Bioinformatics"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"H.N. Gabow","year":"1976","unstructured":"Gabow, H.N.: An efficient implementation of Edmond\u2019s algorithm for maximum matching on graphs. Journal of the ACM\u00a023, 221\u2013234 (1976)","journal-title":"Journal of the ACM"},{"key":"2_CR7","unstructured":"Gabow, H.N.: Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In: SODA, pp. 434\u2013443 (1990)"},{"key":"2_CR8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s004539910008","volume":"26","author":"R.H. M\u00f6hring","year":"2000","unstructured":"M\u00f6hring, R.H., M\u00fcller-Hannemann, M.: Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals. Algorithmica\u00a026, 148\u2013171 (2000)","journal-title":"Algorithmica"},{"issue":"12","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/S0167-8191(00)00049-1","volume":"26","author":"B. Monien","year":"2000","unstructured":"Monien, B., Preis, R., Diekmann, R.: Quality Matching and Local Improvement for Multilevel Graph-Partitioning. Parallel Computing\u00a026(12), 1609\u20131634 (2000)","journal-title":"Parallel Computing"},{"key":"2_CR11","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","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:30:33Z","timestamp":1553355033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}