{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T21:42:16Z","timestamp":1771623736437,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540200642","type":"print"},{"value":"9783540396581","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_62","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:24:30Z","timestamp":1279841070000},"page":"691-702","source":"Crossref","is-referenced-by-count":18,"title":["The Fractional Prize-Collecting Steiner Tree Problem on Trees"],"prefix":"10.1007","author":[{"given":"Gunnar W.","family":"Klau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Weiskircher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"62_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Mathematical Programming\u00a059, 413\u2013420 (1993)","journal-title":"Mathematical Programming"},{"key":"62_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172998","volume-title":"Algorithmic Geometry","author":"J.D. Boissonnat","year":"1998","unstructured":"Boissonnat, J.D., Yvinec, M.: Algorithmic Geometry. Cambridge University Press, Cambridge (1998)"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W. Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Management Science\u00a013, 492\u2013498 (1967)","journal-title":"Management Science"},{"issue":"2","key":"62_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/net.3230170309","volume":"17","author":"C.W. Duin","year":"1987","unstructured":"Duin, C.W., Volgenant, A.: Some generalizations of the Steiner problem in graphs. Networks\u00a017(2), 353\u2013364 (1987)","journal-title":"Networks"},{"issue":"1","key":"62_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jcss.2001.1754","volume":"63","author":"J. Feigenbaum","year":"2001","unstructured":"Feigenbaum, J., Papadimitriou, C.H., Shenker, S.: Sharing the cost of multicast transmissions. Journal of Computer and System Sciences\u00a063(1), 21\u201341 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"62_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01586946","volume":"51","author":"M. Fischetti","year":"1991","unstructured":"Fischetti, M.: Facets of two Steiner arborescence polyhedra. Mathematical Programming\u00a051, 401\u2013419 (1991)","journal-title":"Mathematical Programming"},{"key":"62_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01582064","volume":"63","author":"M.X. Goemans","year":"1994","unstructured":"Goemans, M.X.: The Steiner tree polytope and related polyhedra. Mathematical Programming\u00a063, 157\u2013182 (1994)","journal-title":"Mathematical Programming"},{"key":"62_CR8","unstructured":"Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D.S. (ed.) Approximation algorithms for NP-hard problems, pp. 144\u2013191. P. W. S. Publishing Co. (1996)"},{"key":"62_CR9","unstructured":"Hert, S., Kettner, L., Polzin, T., Sch\u00e4fer, G.: Explab (2002), http:\/\/explab.sourceforge.net"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Klau, G., Ljubi\u0107, I., Mutzel, P., Pferschy, U., Weiskircher, R.: The fractional prize-collecting Steiner tree problem on trees. Technical Report TR-186-1-03-01, Institute of Computer Graphics and Algorithms, Vienna University of Technology (2003)","DOI":"10.1007\/978-3-540-39658-1_62"},{"issue":"4","key":"62_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 optimization with rational objective functions. Mathematics of Operations Research\u00a04(4), 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"62_CR12","doi-asserted-by":"crossref","unstructured":"Radzik, T.: Newton\u2019s method for fractional combinatorial optimization. In: Proceedings of 33rd Annual Symposium on Foundations of Computer Science, pp. 659\u2013669 (1992)","DOI":"10.1109\/SFCS.1992.267785"},{"key":"62_CR13","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/978-1-4613-0303-9_6","volume-title":"Handbook of Combinatorial Optimization","author":"T. Radzik","year":"1998","unstructured":"Radzik, T.: Fractional combinatorial optimization. In: Du, D.Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, pp. 429\u2013478. Kluwer, Dordrecht (1998)"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A. Segev","year":"1987","unstructured":"Segev, A.: The node-weighted Steiner tree problem. Networks\u00a017, 1\u201317 (1987)","journal-title":"Networks"},{"key":"62_CR15","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. John Wiley, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T07:37:34Z","timestamp":1740296254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}