{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:16:16Z","timestamp":1726514176398},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_134","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:41:46Z","timestamp":1330256506000},"page":"318-329","source":"Crossref","is-referenced-by-count":5,"title":["A limited-backtrack greedy schema for approximation algorithms"],"prefix":"10.1007","author":[{"given":"Vivek","family":"Arora","sequence":"first","affiliation":[]},{"given":"Vempala","family":"Santosh","sequence":"additional","affiliation":[]},{"given":"Huzur","family":"Saran","sequence":"additional","affiliation":[]},{"given":"Vijay V.","family":"Vazirani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","unstructured":"P. Berman and V. Ramaiyer, \u201cImproved approximations for the Steiner tree problem\u201d, in Proc. 3rd Annual Symposium on Discrete Algorithms, (1992) 325\u2013334."},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"A. Blum, T. Jiang, M. Li, J. Tromp and M. Yannakakis, \u201cLinear approximation of superstrings\u201d, in Proc. 23rd Annual ACM Symposium on Theory of Computing, (1991) 328\u2013336.","DOI":"10.1145\/103418.103455"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1957","unstructured":"J. Edmonds, \u201cPaths, trees and flowers,\u201d Canadian J. Math. 17 (1957) 449\u2013467.","journal-title":"Canadian J. Math."},{"key":"26_CR4","volume-title":"Computers and Intractability: A guide to the Theory of N P-Completeness","author":"M.R Garey","year":"1979","unstructured":"M.R Garey and D.S. Johnson, \u201cComputers and Intractability: A guide to the Theory of N P-Completeness\u201d, W.H. Freeman & Co., San Francisco, 1979."},{"key":"26_CR5","volume-title":"Working Paper OR 037-74","author":"C. Greene","year":"1974","unstructured":"C. Greene and T.L. Magnanti, \u201cSome abstract pivot algorithms\u201d, Working Paper OR 037-74,(1974), Operations Research Center, MIT,USA."},{"key":"26_CR6","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. Plummer, Matching Theory, Academic Press, Budapest, Hungary, 1986."},{"key":"26_CR7","unstructured":"H. Takahashi and A. Matsuyama, \u201cAn approximate solution for the Steiner problem in graphs,\u201d Math. Japonica."},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-3975(88)90167-3","volume":"57","author":"J. Tarhio","year":"1988","unstructured":"J. Tarhio and E. Ukkonen, \u201cA greedy approximation algorithm for constructing shortest common superstrings,\u201d Theoretical Computer Science 57 (1988) 131\u2013145.","journal-title":"Theoretical Computer Science"},{"key":"26_CR9","unstructured":"A. Z. Zelikovsky, \u201cA 11\/6 algorithm for the Steiner problem on networks\u201d, to appear in Information and Computation."}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_134.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:23:46Z","timestamp":1605630226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}