{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T07:47:37Z","timestamp":1717228057831},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,5,11]],"date-time":"2011-05-11T00:00:00Z","timestamp":1305072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9523-4","type":"journal-article","created":{"date-parts":[[2011,5,10]],"date-time":"2011-05-10T11:37:37Z","timestamp":1305027457000},"page":"137-157","source":"Crossref","is-referenced-by-count":5,"title":["Maximum Series-Parallel Subgraph"],"prefix":"10.1007","volume":"63","author":[{"given":"Gruia","family":"C\u0103linescu","sequence":"first","affiliation":[]},{"given":"Cristina G.","family":"Fernandes","sequence":"additional","affiliation":[]},{"given":"Hemanshu","family":"Kaul","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Zelikovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,11]]},"reference":[{"key":"9523_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P. Berman","year":"1994","unstructured":"Berman,\u00a0P., Ramaiyer,\u00a0V.: Improved approximations for the Steiner tree problem. J. Algorithms 17, 381\u2013408 (1994)","journal-title":"J. Algorithms"},{"issue":"3","key":"9523_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0166-218X(96)00045-5","volume":"74","author":"L. Cai","year":"1997","unstructured":"Cai,\u00a0L.: On spanning 2-trees in a graph. Discrete Appl. Math. 74(3), 203\u2013216 (1997)","journal-title":"Discrete Appl. Math."},{"key":"9523_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90228-G","volume":"44","author":"L. Cai","year":"1993","unstructured":"Cai,\u00a0L., Maffray,\u00a0F.: On the spanning k-tree problem. Discrete Appl. Math. 44, 139\u2013156 (1993)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9523_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jagm.1997.0920","volume":"27","author":"G. C\u0103linescu","year":"1998","unstructured":"C\u0103linescu,\u00a0G., Fernandes, C.G., Finkler,\u00a0U., Karloff,\u00a0H.: A\u00a0better approximation algorithm for finding planar subgraphs. J. Algorithms 27(2), 269\u2013302 (1998)","journal-title":"J. Algorithms"},{"issue":"2","key":"9523_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s00453-002-1020-3","volume":"36","author":"G. C\u0103linescu","year":"2003","unstructured":"C\u0103linescu,\u00a0G., Fernandes, C.G., Karloff,\u00a0H., Zelikovski,\u00a0A.: A\u00a0new approximation algorithm for finding heavy planar subgraphs. Algorithmica 36(2), 179\u2013205 (2003)","journal-title":"Algorithmica"},{"key":"9523_CR6","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"9523_CR7","first-page":"770","volume-title":"Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"G. Robins","year":"2000","unstructured":"Robins,\u00a0G., Zelikovsky,\u00a0A.: Improved steiner tree approximation in graphs. In: Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms (SODA) pp.\u00a0770\u2013779 (2000)"},{"key":"9523_CR8","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver,\u00a0A.: Combinatorial Optimization, vol.\u00a0A. Springer, Berlin (2003). Available at http:\/\/homepages.cwi.nl\/lex\/files\/dict.ps"},{"key":"9523_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Networks Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Networks Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9523-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9523-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9523-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:07Z","timestamp":1559123107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9523-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,11]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9523"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9523-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,11]]}}}