{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:41:07Z","timestamp":1736516467837,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_21","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"208-219","source":"Crossref","is-referenced-by-count":0,"title":["The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Angelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P.N., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner tree problem on networks. SIAM Journal on Computing\u00a024, 440\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: Proceedings of the 35th Annual ACM Symposium on the Theory of Computation, pp. 100\u2013105 (2003)","DOI":"10.1145\/780542.780558"},{"key":"21_CR3","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 570\u2013579 (2005)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: Online algorithms for Steiner tree problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp. 344\u2013353 (1997)","DOI":"10.1145\/258533.258618"},{"key":"21_CR5","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 problem with edge lengths 1 and 2. Information Processing Letters\u00a032, 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"issue":"33","key":"21_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"1","author":"M. Charikar","year":"1999","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed steiner problems. Journal of Algorithms\u00a01(33), 73\u201391 (1999)","journal-title":"Journal of Algorithms"},{"key":"21_CR7","unstructured":"Faloutsos, M.: The Greedy the Naive and the Optimal Multicast Routing\u2013From Theory to Internet Protocols. PhD thesis, University of Toronto (1998)"},{"issue":"6","key":"21_CR8","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1142\/S0129054102001527","volume":"13","author":"M. Faloutsos","year":"2002","unstructured":"Faloutsos, M., Pankaj, R., Sevcik, K.C.: The effect of asymmetry on the on-line multicast routing problem. Int. J. Found. Comput. Sci.\u00a013(6), 889\u2013910 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"21_CR9","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM Journal on Computing\u00a06(24) (1995)","DOI":"10.1137\/S0097539793242618"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node weighted steiner trees and connected dominating sets. Information and Computation\u00a0(150), 228\u2013248 (1999)","DOI":"10.1006\/inco.1998.2754"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.: The dynamic Steiner tree problem. SIAM Journal on Discrte Mathematics\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM Journal on Discrte Mathematics"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Klein, P., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms\u00a0(19), 104\u2013115 (1995)","DOI":"10.1006\/jagm.1995.1029"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"21_CR16","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770\u2013779 (2000)"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Segev, A.: The node-weighted steiner tree problem. Networks\u00a0(17), 1\u201317 (1987)","DOI":"10.1002\/net.3230170102"},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0304-3975(02)00414-0","volume":"295","author":"M. Thimm","year":"2003","unstructured":"Thimm, M.: On the approximability of the Steiner tree problem. Theoretical Computer Science\u00a0295(1), 387\u2013402 (2003)","journal-title":"Theoretical Computer Science"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"},{"key":"21_CR20","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations:towards a unified measure of complexity. In: Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, pp. 222\u2013227 (1997)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T15:21:33Z","timestamp":1736436093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11785293_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}