{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:21:26Z","timestamp":1742962886094,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-90530-3_23","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"269-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Facility Location on Planar Graphs with Unreliable Links"],"prefix":"10.1007","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meghana","family":"Nasre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Vijayaragunathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.L.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5(1), 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"23_CR3","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1\u201323 (1993)","journal-title":"Acta Cybern."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0304-3975(97)00124-2","volume":"209","author":"CJ Colbourn","year":"1998","unstructured":"Colbourn, C.J., Xue, G.: A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges. Theor. Comput. Sci. 209(1), 331\u2013345 (1998)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/trsc.17.1.48","volume":"17","author":"MS Daskin","year":"1983","unstructured":"Daskin, M.S.: A maximum expected covering location model: formulation, properties and heuristic solution. Transp. Sci. 17(1), 48\u201370 (1983)","journal-title":"Transp. Sci."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Ding, W.: Computing the most reliable source on stochastic ring networks. In: 2009 WRI World Congress on Software Engineering, vol. 1, pp. 345\u2013347, May 2009","DOI":"10.1109\/WCSE.2009.31"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Ding, W.: Extended most reliable source on an unreliable general network. In: 2011 International Conference on Internet Computing and Information Services, pp. 529\u2013533, September 2011","DOI":"10.1109\/ICICIS.2011.138"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","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). Combinatorial Optimization and Applications","journal-title":"Theor. Comput. Sci."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-04128-0_24","volume-title":"Algorithms - ESA 2009","author":"R Hassin","year":"2009","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Tractable cases of facility location on a network with a linear reliability order of links. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 275\u2013276. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04128-0_24"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-017-0121-5","volume":"34","author":"R Hassin","year":"2017","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Multiple facility location on a network with linear reliability order of edges. J. Comb. Optim. 34(3), 1\u201325 (2017)","journal-title":"J. Comb. Optim."},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth: Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"23_CR12","volume-title":"Matching Theory (North-Holland Mathematics Studies)","author":"L Lovasz","year":"1986","unstructured":"Lovasz, L.: Matching Theory (North-Holland Mathematics Studies). Elsevier Science Ltd., Oxford (1986)"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<219::AID-NET7>3.0.CO;2-L","volume":"27","author":"E Melachrinoudis","year":"1996","unstructured":"Melachrinoudis, E., Helander, M.E.: A single facility location problem on a tree with unreliable edges. Networks 27(3), 219\u2013237 (1996)","journal-title":"Networks"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"23_CR15","volume-title":"The Design of Approximation Algorithms","author":"DB Shmoys","year":"2011","unstructured":"Shmoys, D.B., Williamson, D.P.: The Design of Approximation Algorithms, 1st edn. Cambridge University Press, New York (2011)","edition":"1"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:30:52Z","timestamp":1710243052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_23","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":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}