{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:33Z","timestamp":1759637913698,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_1","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Diameter k-Steiner Forest"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized Steiner problem in networks. SIAM J. Comput. 24(3), 440\u2013456 (1995)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2027216.2027219","volume":"58","author":"M Bateni","year":"2011","unstructured":"Bateni, M., Hajiaghayi, M., Marx, D.: Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58(5), 1\u201321 (2011)","journal-title":"J. ACM"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/j.jpdc.2004.03.009","volume":"64","author":"M Bui","year":"2004","unstructured":"Bui, M., Butelle, F., Lavault, C.: A distributed algorithm for constructing a minimum diameter spanning tree. J. Parallel Distrib. Comput. 64(5), 571\u2013577 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s10878-012-9591-7","volume":"28","author":"W Ding","year":"2014","unstructured":"Ding, W., Qiu, K.: Algorithms for the minimum diameter terminal Steiner tree problem. J. Comb. Optim. 28(4), 837\u2013853 (2014)","journal-title":"J. Comb. Optim."},{"key":"1_CR5","unstructured":"Dinitz, M., Kortsarz, G., Nutov, Z.: Improved approximation algorithm for Steiner $$k$$-forest with nearly uniform weights. In: 17th APPROX, pp. 115\u2013127 (2014)"},{"key":"1_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/6729","volume-title":"Steiner Tree Problems in Computer Communication Networks","author":"D Du","year":"2008","unstructured":"Du, D., Hu, X.: Steiner Tree Problems in Computer Communication Networks. World Scientific Publishing Co., Pte. Ltd., Singapore (2008)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M., Jain, K.: The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema. In: Proceedings of the 17th SODA, pp. 631\u2013640 (2006)","DOI":"10.1145\/1109557.1109626"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R Hassin","year":"1995","unstructured":"Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Inf. Process. Lett. 53, 109\u2013111 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the $$k$$-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk, J.: A heuristic for the $$p$$-center problem in graphs. Discrete Appl. Math. 17, 263\u2013268 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(94)00034-4","volume":"50","author":"R Ravi","year":"1994","unstructured":"Ravi, R.: A primal-dual approximation algorithm for the Steiner forest problem. Inf. Process. Lett. 50(4), 185\u2013189 (1994)","journal-title":"Inf. Process. Lett."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00453-008-9189-8","volume":"56","author":"D Segev","year":"2010","unstructured":"Segev, D., Segev, G.: Approximate $$k$$-Steiner forests via the Lagrangian relaxation technique with internal preprocessing. Algorithmica 56, 529\u2013549 (2010)","journal-title":"Algorithmica"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF01935369","volume":"25","author":"P Winter","year":"1985","unstructured":"Winter, P.: Generalized Steiner problem in outerplanar graphs. BIT Numer. Math. 25(3), 485\u2013496 (1985)","journal-title":"BIT Numer. Math."},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0196-6774(86)90018-0","volume":"7","author":"P Winter","year":"1986","unstructured":"Winter, P.: Generalized Steiner problem in series-parallel networks. J. Algorithms 7(4), 549\u2013566 (1986)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:56:35Z","timestamp":1710338195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}