{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:32Z","timestamp":1759063592183},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_29","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:17:32Z","timestamp":1188335852000},"page":"338-349","source":"Crossref","is-referenced-by-count":6,"title":["Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets"],"prefix":"10.1007","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[]},{"given":"Motoyasu","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Yuichiro","family":"Itatsu","sequence":"additional","affiliation":[]},{"given":"Hideyuki","family":"Uehara","sequence":"additional","affiliation":[]},{"given":"Mitsuo","family":"Yokoyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"key":"29_CR1","unstructured":"Aho, A. V., Hopcroft, J. E., and Ullman, J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley (1974)."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Arata, K., Iwata, S., Makino, K., and Fujishige, S., Locating sources to meet ow demands in undirected networks, manuscript (2000).","DOI":"10.1007\/3-540-44985-X_27"},{"key":"29_CR3","unstructured":"Downey, R. G. and Fellows, M. R., Parameterized Complexity, Springer (1997)."},{"key":"29_CR4","unstructured":"Garey, M. R. and Johnson, D. S., Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman (1979)."},{"issue":"8","key":"29_CR5","first-page":"9","volume":"99","author":"S. Honami","year":"1999","unstructured":"Honami, S., Ito, H., Uehara, H., and Yokoyama, M., An algorithm for finding a node-subset having high connectivity from other nodes, IPSJ SIG Notes, AL-66, 99, 8, pp. 9\u201316 (1999). (in Japanese)","journal-title":"IPSJ SIG Notes"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"Hopcroft, J. E. and Tarjan, R. E., Dividing a graph into triconnected components, SIAM J. Comput., 2, pp. 135\u2013158 (1973).","journal-title":"SIAM J. Comput."},{"key":"29_CR7","doi-asserted-by":"publisher","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. and Yokoyama, M., Edge connectivity between nodes and node-subsets, Networks, 31, pp. 157\u2013164 (1998).","journal-title":"Networks"},{"key":"29_CR8","first-page":"704","volume":"E83-A 4","author":"H. Ito","year":"2000","unstructured":"Ito, H., Uehara H., and Yokoyama, M., A faster and exible algorithm for a location problem on undirected ow networks, IEICE Trans., E83-A, 4, pp. 704\u2013712 (2000).","journal-title":"IEICE Trans."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Labbe, M., Peeters, D., and Thisse, J.-F., Location on networks, In M. O. Ball et al. (eds.), Handbooks in OR & MS, 8, North-Holland, pp. 551\u2013624 (1995).","DOI":"10.1016\/S0927-0507(05)80111-2"},{"key":"29_CR10","first-page":"513","volume":"E76-A","author":"H. Nagamochi","year":"1993","unstructured":"Nagamochi, H. and Watanabe, T., Computing k-edge-connected components in multigraphs, IEICE Trans., E76-A, pp. 513\u2013517 (1993).","journal-title":"IEICE Trans."},{"key":"29_CR11","first-page":"1989","volume":"E73","author":"H. Tamura","year":"1990","unstructured":"Tamura, H., Sengoku, M., Shinoda, S., and Abe, T., Location problems on undirected ow networks, IEICE Trans., E73, pp. 1989\u20131993 (1990).","journal-title":"IEICE Trans."},{"key":"29_CR12","first-page":"863","volume":"J81-A","author":"H. Tamura","year":"1998","unstructured":"Tamura, H., Sugawara, H., Sengoku, M., and Shinoda, S., Plural cover problem on undirected ow networks, IEICE Trans. A, J81-A, pp. 863\u2013869 (1998). (in Japanese)","journal-title":"IEICE Trans. A"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:26:03Z","timestamp":1556803563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}