{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:45:30Z","timestamp":1725558330816},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405450"},{"type":"electronic","value":"9783540450788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45078-8_35","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T17:23:52Z","timestamp":1277227432000},"page":"401-411","source":"Crossref","is-referenced-by-count":2,"title":["Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion I.","family":"M\u0103ndoiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Olshevsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Zelikovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A. Balakrishnan","year":"1994","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem. Management Science\u00a040, 846\u2013867 (1994)","journal-title":"Management Science"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1287\/opre.44.3.478","volume":"44","author":"A. Balakrishnan","year":"1996","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Heuristics, LPs, and Trees on Trees: Network Design Analyses. Operations Research\u00a044, 478\u2013496 (1996)","journal-title":"Operations Research"},{"key":"35_CR3","unstructured":"Berman, P., Ramaiyer, V.: Improved Approximations for the Steiner Tree Problem. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 1992), pp. 325\u2013334 (1992)"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/S0097539795281086","volume":"26","author":"A. Borchers","year":"1997","unstructured":"Borchers, A., Du, D.Z.: The k-Steiner Ratio in Graphs. SIAM Journal on Computing\u00a026, 857\u2013869 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Charikar, M., Naor, J., Schieber, B.: Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. In: Proceedings of the 19th Annual IEEE INFOCOM (2000)","DOI":"10.1109\/INFCOM.2000.832550"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(86)80007-8","volume":"27","author":"J.R. Current","year":"1986","unstructured":"Current, J.R., Revelle, C.S., Cohon, J.L.: The Hierarchical Network Design Problem. European Journal of Operations Research\u00a027, 57\u201366 (1986)","journal-title":"European Journal of Operations Research"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1109\/49.564134","volume":"15","author":"N. Maxemchuk","year":"1997","unstructured":"Maxemchuk, N.: Video Distribution on Multicast Networks. IEEE Journal on Selected Issues in Communications\u00a015, 357\u2013372 (1997)","journal-title":"IEEE Journal on Selected Issues in Communications"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/ijoc.8.3.202","volume":"8","author":"P. Mirchandani","year":"1996","unstructured":"Mirchandani, P.: The Multi-Tier Tree Problem. INFORMS Journal on Computing\u00a08, 202\u2013218 (1996)","journal-title":"INFORMS Journal on Computing"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters\u00a027, 125\u2013128 (1988)","journal-title":"Information Processing Letters"},{"key":"35_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/jagm.2000.1086","volume":"36","author":"H. Promel","year":"2000","unstructured":"Promel, H., Steger, A.: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio (\n                  \n                    \n                  \n                  $\\frac{5}{3}$\n                ). Journal of Algorithms\u00a036, 89\u2013101 (2000)","journal-title":"Journal of Algorithms"},{"key":"35_CR11","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proc. of ACM\/SIAM Symposium on Discrete Algorithms (SODA 2000), pp. 770\u2013779."},{"key":"35_CR12","first-page":"573","volume":"6","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math. Japonica\u00a06, 573\u2013577 (1980)","journal-title":"Math. Japonica"},{"key":"35_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s00453-001-0050-6","volume":"31","author":"G. Xue","year":"2001","unstructured":"Xue, G., Lin, G.-H., Du, D.-Z.: Grade of Service Steiner Minimum Trees in the Euclidean Plane. Algorithmica\u00a031, 479\u2013500 (2001)","journal-title":"Algorithmica"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: An 11\/6-appraoximation algorithm for the network Steiner problem. Algorithmica\u00a09, 463\u2013470 (1993)","journal-title":"Algorithmica"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(93)90201-J","volume":"46","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: A faster approximation algorithm for the Steiner tree problem in graphs. Information Processing Letters\u00a046, 79\u201383 (1993)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45078-8_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:16:24Z","timestamp":1552598184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45078-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405450","9783540450788"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45078-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}