{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:15:20Z","timestamp":1749701720529,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_30","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"408-420","source":"Crossref","is-referenced-by-count":0,"title":["A Quadratic Time Exact Algorithm for Continuous Connected 2-Facility Location Problem in Trees (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM. 45(3), 501\u2013555 (1998)","journal-title":"J. ACM."},{"issue":"4","key":"30_CR2","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1287\/ijoc.1090.0375","volume":"22","author":"MG Bardossy","year":"2010","unstructured":"Bardossy, M.G., Raghavan, S.: Dual-based local search for the connected facility location and related problems. INFORMS J. Comput. 22(4), 584\u2013602 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"30_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.tcs.2009.08.003","volume":"412","author":"W Ding","year":"2011","unstructured":"Ding, W., Xue, G.: A linear time algorithm for computing a most reliable source on a tree network with faulty nodes. Theor. Comput. Sci. 412(3), 225\u2013232 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"8","key":"30_CR5","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1016\/j.jcss.2010.02.001","volume":"76","author":"F Eisenbrand","year":"2010","unstructured":"Eisenbrand, F., Grandoni, F., Rothvo\u00df, T., Sch\u00e4fer, G.: Connected facility location via random facility sampling and core detouring. J. Comput. Syst. Sci. 76(8), 709\u2013726 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proceedings of 33rd STOC, pp. 389\u2013398 (2001)","DOI":"10.1145\/380752.380830"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: Proceedings of 35th STOC, pp. 365\u2013372 (2003)","DOI":"10.1145\/780542.780597"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-540-27821-4_13","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Gupta","year":"2004","unstructured":"Gupta, A., Srinivasan, A., Tardos, \u00c9.: Cost-sharing mechanisms for network design. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 139\u2013150. Springer, Heidelberg (2004)"},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10878-007-9130-0","volume":"16","author":"MK Hasan","year":"2008","unstructured":"Hasan, M.K., Jung, H., Chwa, K.Y.: Approximation algorithms for connected facility location problems. J. Combinatirial Optim. 16, 155\u2013172 (2008)","journal-title":"J. Combinatirial Optim."},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-540-85097-7_25","volume-title":"Combinatorial Optimization and Applications","author":"H Jung","year":"2008","unstructured":"Jung, H., Hasan, M.K., Chwa, K.-Y.: Improved primal-dual approximation algorithm for the connected facility location problem. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 265\u2013277. Springer, Heidelberg (2008)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: Proceedings of 41st FOCS, pp. 613\u2013623 (2000)","DOI":"10.1109\/SFCS.2000.892329"},{"issue":"3","key":"30_CR12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1287\/ijoc.8.3.194","volume":"8","author":"Y Lee","year":"1996","unstructured":"Lee, Y., Chiu, S.Y., Ryan, J.: A branch and cut algorithm for a Steiner tree-star problem. INFORMS J. Comput. 8(3), 194\u2013201 (1996)","journal-title":"INFORMS J. Comput."},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-75514-2_12","volume-title":"Hybrid Metaheuristics","author":"I Ljubi\u0107","year":"2007","unstructured":"Ljubi\u0107, I.: A hybrid VNS for connected facility location. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI\/ICCV 2007. LNCS, vol. 4771, pp. 157\u2013169. Springer, Heidelberg (2007)"},{"issue":"1","key":"30_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/opre.1050.0228","volume":"54","author":"R Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Approximation algorithms for problems combining facility location and network design. Oper. Res. 54(1), 73\u201381 (2006)","journal-title":"Oper. Res."},{"issue":"4","key":"30_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s00453-004-1112-3","volume":"40","author":"C Swamy","year":"2004","unstructured":"Swamy, C., Kumar, A.: Primal-dual algorithms for connected facility location problems. Algorithmica 40(4), 245\u2013269 (2004)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T22:35:18Z","timestamp":1749681318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}