{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T05:21:40Z","timestamp":1740374500360,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_21","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"244-251","source":"Crossref","is-referenced-by-count":4,"title":["On the Covering Steiner Problem"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, October 1996, pp. 184\u2013193 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pp. 379\u2013388 (1998)","DOI":"10.1109\/SFCS.1998.743488"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Even, G., Kortsarz, G., Slany, W.: On network design problems: fixed cost flows and the Covering Steiner problem. In: Proceedings of the Scandinavian Workshop on Algorithm Theory, pp. 318\u2013327 (2002)","DOI":"10.1007\/3-540-45471-3_33"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 448\u2013455 (2003)","DOI":"10.1145\/780542.780608"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N. Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. Journal of Algorithms\u00a037(1), 66\u201384 (2000); Preliminary version in 9th SODA, 253\u2013259 (1998)","journal-title":"Journal of Algorithms"},{"key":"21_CR6","unstructured":"Halperin, E., Kortsarz, G., Krauthgamer, R., Srinivasan, A., Wang, N.: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 275\u2013284 (2003)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic Inapproximability. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 585\u2013594 (2003)","DOI":"10.1145\/780627.780628"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/rsa.3240010209","volume":"1","author":"S. Janson","year":"1990","unstructured":"Janson, S.: Poisson approximations for large deviations. Random Structures & Algorithms\u00a01, 221\u2013230 (1990)","journal-title":"Random Structures & Algorithms"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/rsa.10038","volume":"20","author":"G. Konjevod","year":"2002","unstructured":"Konjevod, G., Ravi, R., Srinivasan, A.: Approximation Algorithms for the Covering Steiner Problem. Random Structures & Algorithms (Special Issue on Probabilistic Methods in Combinatorial Optimization)\u00a020, 465\u2013482 (2002)","journal-title":"Random Structures & Algorithms (Special Issue on Probabilistic Methods in Combinatorial Optimization)"},{"key":"21_CR10","unstructured":"Srinivasan, A.: New approaches to covering and packing problems. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 567\u2013576 (2001)"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T15:21:10Z","timestamp":1740324070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}