{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:54:06Z","timestamp":1649087646982},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s00186-008-0266-1","type":"journal-article","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T09:30:34Z","timestamp":1221816634000},"page":"183-193","source":"Crossref","is-referenced-by-count":1,"title":["Maximum-cover source location problems with objective edge-connectivity three"],"prefix":"10.1007","volume":"70","author":[{"given":"Kenya","family":"Sugihara","sequence":"first","affiliation":[]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"266_CR1","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1006\/jagm.2001.1203","volume":"42","author":"K Arata","year":"2002","unstructured":"Arata K, Iwata S, Makino K, Fujishige S (2002) Locating sources to meet flow demands in undirected networks. J Alg 42: 54\u201368","journal-title":"J Alg"},{"issue":"3","key":"266_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.orl.2004.07.005","volume":"33","author":"M B\u00e1r\u00e1sz","year":"2005","unstructured":"B\u00e1r\u00e1sz M, Becker J, Frank A (2005) An algorithm for source location in directed graphs. Oper Res Lett 33(3): 221\u2013230","journal-title":"Oper Res Lett"},{"key":"266_CR3","unstructured":"Ishii T, Fujita H, Nagamochi H (2003) Source location problem with local 3-vertex-connectivity requirements. In: Proceedings of 3rd Hungarian\u2013Japanese symposium on discrete mathematics and its applications, pp. 368\u2013377"},{"key":"266_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/net.10034","volume":"40","author":"H Ito","year":"2002","unstructured":"Ito H, Ito M, Itatsu Y, Uehara H, Yokoyama M (2002) Source location problems considering vertex-connectivity and edge-connectivity simultaneously. Networks 40: 63\u201370","journal-title":"Networks"},{"issue":"4","key":"266_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1080\/1055-6780309510593","volume":"18","author":"H Ito","year":"2003","unstructured":"Ito H, Makino K, Arata S, Honami S, Itatsu Y, Fujishige S (2003) Source location problem with flow requirements in directed networks. Optim Methods Softw 18(4): 427\u2013435","journal-title":"Optim Methods Softw"},{"key":"266_CR6","first-page":"704","volume":"E83-A","author":"H Ito","year":"2000","unstructured":"Ito H, Uehara H, Yokoyama M (2000) A faster and flexible algorithm for a location problem on undirected flow networks. IEICE Trans Fund E83-A: 704\u2013712","journal-title":"IEICE Trans Fund"},{"key":"266_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<157::AID-NET2>3.0.CO;2-E","volume":"31","author":"H Ito","year":"1998","unstructured":"Ito H, Yokoyama M (1998) Edge connectivity between nodes and node-subsets. Networks 31: 157\u2013164","journal-title":"Networks"},{"key":"266_CR8","doi-asserted-by":"crossref","unstructured":"Karpinski M (2001) Approximating bounded degree instances of NP-hard problems.In: Proceedings of 13th conference on fundamentals of computation theory, LNCS 2138, pp 24\u201334","DOI":"10.1007\/3-540-44669-9_4"},{"key":"266_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(01)00183-1","volume":"80","author":"H Nagamochi","year":"2001","unstructured":"Nagamochi H, Ishii T, Ito H (2001) Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf Process Lett 80: 287\u2013294","journal-title":"Inf Process Lett"},{"key":"266_CR10","doi-asserted-by":"crossref","first-page":"1370","DOI":"10.1093\/ietfec\/e89-a.5.1370","volume":"E89-A","author":"K Sugihara","year":"2006","unstructured":"Sugihara K, Ito H (2006) Maximum-cover source-location problems. IEICE Trans Fund E89-A: 1370\u20131377","journal-title":"IEICE Trans Fund"},{"key":"266_CR11","first-page":"1989","volume":"E73-E","author":"H Tamura","year":"1990","unstructured":"Tamura H, Sengoku M, Shinoda S, Abe T (1990) Location problems on undirected flow networks. IEICE Trans E73-E: 1989\u20131993","journal-title":"IEICE Trans"},{"issue":"(2","key":"266_CR12","first-page":"125","volume":"40","author":"YH Tsin","year":"2005","unstructured":"Tsin YH (2005) A simple 3-edge-connected component algorithm. Theory Comput Syst 40((2): 125\u2013142","journal-title":"Theory Comput Syst"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0266-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-008-0266-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-008-0266-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T14:33:28Z","timestamp":1558622008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-008-0266-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["266"],"URL":"https:\/\/doi.org\/10.1007\/s00186-008-0266-1","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,20]]}}}