{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:18Z","timestamp":1725544038533},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341666"},{"type":"electronic","value":"9783540341680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_10","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"70-79","source":"Crossref","is-referenced-by-count":2,"title":["Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"F\u00fcrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Zelikovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner tree problem with edge lengths 1 and 2. Inform. Process. Lett.\u00a032, 171\u2013176 (1989)","journal-title":"Inform. Process. Lett."},{"unstructured":"Calinescu, G., Fernandes, C.G., Finkler, U., Karloff, H.: A better approximation algorithm for finding planar subgraphs. In: Proc. 7th SODA, pp. 16\u201325 (1996)","key":"10_CR2"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0015746","volume-title":"Automata, Languages and Programming","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol.\u00a0194, pp. 210\u2013220. Springer, Heidelberg (1985)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0020-0190(01)00335-0","volume":"83","author":"C. Gr\u00f6pl","year":"2002","unstructured":"Gr\u00f6pl, C., Hougardy, S., Nierhoff, T., Pr\u00f6mel, H.J.: Steiner trees in uniformly quasi-bipartite graphs. Information Processing Letters\u00a083, 195\u2013200 (2002)","journal-title":"Information Processing Letters"},{"key":"10_CR5","first-page":"495","volume":"2","author":"L. Lov\u00e1sz","year":"1981","unstructured":"Lov\u00e1sz, L.: The matroid matching problem. Algebraic Methods in Graph Theory\u00a02, 495\u2013518 (1981)","journal-title":"Algebraic Methods in Graph Theory"},{"key":"10_CR6","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. Elsevier Science, Amsterdam (1986)"},{"issue":"Series A","key":"10_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01580854","volume":"47","author":"Orlin","year":"1990","unstructured":"Orlin, Vate, V.: Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems. Mathematical Programming\u00a047(Series A), 81\u2013106 (1990)","journal-title":"Mathematical Programming"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G. Robins","year":"2005","unstructured":"Robins, G., Zelikovsky, A.: Tighter Bounds for Graph Steiner Tree Approximation. SIAM Journal on Discrete Mathematics\u00a019, 122\u2013134 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:27Z","timestamp":1619507007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11753728_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}