{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:07Z","timestamp":1725557947096},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_3","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T09:34:40Z","timestamp":1277285680000},"page":"13-24","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data"],"prefix":"10.1007","author":[{"given":"E.","family":"\u00c1lvarez-Miranda","sequence":"first","affiliation":[]},{"given":"A.","family":"Candia","sequence":"additional","affiliation":[]},{"given":"X.","family":"Chen","sequence":"additional","affiliation":[]},{"given":"X.","family":"Hu","sequence":"additional","affiliation":[]},{"given":"B.","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0167-6377(03)00058-0","volume":"32","author":"I.D. Aron","year":"2004","unstructured":"Aron, I.D., Hentenryck, P.V.: On the complexity of the robust spanning tree problem with interval data. Operations Research Letters\u00a032, 36\u201340 (2004)","journal-title":"Operations Research Letters"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize cllecting travelling salesman problem. Network\u00a019, 621\u2013636 (1989)","journal-title":"Network"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(03)00088-4","volume":"304","author":"G. Chen","year":"2003","unstructured":"Chen, G., Xue, G.: A PTAS for weight constrained Steiner trees in series parallel graphs. Theoretical Computer Science\u00a0304, 237\u2013247 (2003)","journal-title":"Theoretical Computer Science"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2008.06.039","volume":"198","author":"X.J. Chen","year":"2009","unstructured":"Chen, X.J., Hu, J., Hu, X.D.: The polynomial solvable minimum risk spanning tree problem with interval data. European Journal Operational Research\u00a0198, 43\u201346 (2009)","journal-title":"European Journal Operational Research"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2007.03.012","volume":"103","author":"P. Feofiloff","year":"2007","unstructured":"Feofiloff, P., Fernandes, C.G., Ferreira, C.E., Pina, J.C.: Primal-dual approximation algorithms for the prize collecting Steiner tree problem. Information Processing Letters\u00a0103(5), 195\u2013202 (2007)","journal-title":"Information Processing Letters"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10255-008-8812-4","volume":"26","author":"J. Hu","year":"2010","unstructured":"Hu, J.: Minimizing maximum risk for fair network connection with interval data. Acta Mathematicae Applicatae Sinica\u00a026(1), 33\u201340 (2010)","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, Amsterdam (1992)","DOI":"10.1002\/net.3230220105"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Tatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1007\/978-3-540-39658-1_62","volume-title":"Algorithms - ESA 2003","author":"G. Klau","year":"2003","unstructured":"Klau, G., Ljubic, I., Mutzel, P., Pferschy, U., Weiskircher, R.: The fractional prize collecting Steiner tree problem on trees. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 691\u2013702. Springer, Heidelberg (2003)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0166-218X(03)00380-9","volume":"141","author":"A. Lucena","year":"1979","unstructured":"Lucena, A., Resende, M.G.: Strong lower bounds for the prize collecting Steiner tree problem in graphs. Discrete Applied Mathematics\u00a0141, 277\u2013294 (1979)","journal-title":"Discrete Applied Mathematics"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimizaion with rational objective functions. Mathematics of Operations Research\u00a04, 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J.A. Wald","year":"1983","unstructured":"Wald, J.A., Colbourn, C.J.: Steiner trees, partial 2-trees, and minimum IFI networks. Networks\u00a013, 159\u2013167 (1983)","journal-title":"Networks"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P. Zielinski","year":"2004","unstructured":"Zielinski, P.: The computational complexity of the relative robust shortest path problem with interval data. European Journal Operational Research\u00a0158, 570\u2013576 (2004)","journal-title":"European Journal Operational Research"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:51:35Z","timestamp":1606168295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}