{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:16:19Z","timestamp":1743063379254,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_46","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"289-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Securely Connected Facility Location in Metric Graphs"],"prefix":"10.1007","author":[{"given":"Maren","family":"Martens","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Bley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"J. Byrka and K. Aardal. An optimal bifactor approximation algorithm for the metric unca-pacitated facility location problem. SIAM Journal on Computing, 2010. to appear.","key":"46_CR1_46","DOI":"10.1137\/070708901"},{"unstructured":"M. Chimani, M. Kandyba, and M. Martens. 2-interconnected facility location: Specifications, complexity results, and exact solutions. Technical Report TR09-1-008, Computer Science Department, Technical University Dortmund, 2009.","key":"46_CR2_46"},{"unstructured":"N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, 1976.","key":"46_CR3_46"},{"unstructured":"F. Eisenbrand, F. Grandoni, T. Rothvo\u00df, and G. Sch\u00e4fer. Approximating connected facility location problems via random facility sampling and core detouring. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1174\u20131183, 2008.","key":"46_CR4_46"},{"key":"46_CR5_46","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"G. N. Frederickson","year":"1982","unstructured":"G. N. Frederickson and J. Ja\u2019Ja\u2019. On the relationship between the binconnectivity augmentation and traveling salesman problems. Theoretical Computer Science, 19: 189\u2013201, 1982.","journal-title":"Theoretical Computer Science"},{"unstructured":"S. Kedad-Sidhoum and V. H. Nguyen. An exact algorithm for solving the ring star problem. http:\/\/www.optimization-online.org\/DB_HTML\/2008\/03\/1942.html, March 2008.","key":"46_CR6_46"},{"issue":"3","key":"46_CR7_46","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/net.10114","volume":"43","author":"M. Labbe","year":"2004","unstructured":"M. Labbe, G. Laporte, I. Rodriguez Martin, and J. J. Salazar Gonzalez. The ring star problem: Polyhedral analysis and exact algorithm. Networks, 43(3): 177\u2013189, 2004.","journal-title":"Networks"},{"issue":"2","key":"46_CR8_46","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01585735","volume":"46","author":"C. L. Monma","year":"1990","unstructured":"C. L. Monma, B. S. Munson, and W. R. Pulleyblank. Minimum-weight two-connected spanning networks. Mathematical Programming, 46(2): 153\u2013171, 1990.","journal-title":"Mathematical Programming"},{"doi-asserted-by":"crossref","unstructured":"M. Pioro and D. Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, 2004.","key":"46_CR9_46","DOI":"10.1016\/B978-012557189-0\/50011-1"},{"doi-asserted-by":"crossref","unstructured":"R. Ravi and F. S. Salman. Approximation algorithms for the traveling purchaser problem and its variants in network design. In Proceedings of the 7th Annual European Symposium on Algorithms, pages 29\u201340, 1999.","key":"46_CR10_46","DOI":"10.1007\/3-540-48481-7_4"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T04:39:45Z","timestamp":1676090385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_46","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"21 June 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}