{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:43:58Z","timestamp":1649047438447},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,3,15]],"date-time":"2008-03-15T00:00:00Z","timestamp":1205539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s00453-008-9178-y","type":"journal-article","created":{"date-parts":[[2008,3,14]],"date-time":"2008-03-14T10:42:58Z","timestamp":1205491378000},"page":"413-436","source":"Crossref","is-referenced-by-count":1,"title":["Minimum Augmentation of Edge-Connectivity between\u00a0Vertices and Sets of Vertices in\u00a0Undirected\u00a0Graphs"],"prefix":"10.1007","volume":"56","author":[{"given":"Toshimasa","family":"Ishii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoko","family":"Akiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,3,15]]},"reference":[{"key":"9178_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.: Locating sources to meet flow demands in undirected networks. J. Algorithms 42, 54\u201368 (2002)","journal-title":"J. Algorithms"},{"key":"9178_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s101070050034","volume":"84","author":"A. Bencz\u00far","year":"1999","unstructured":"Bencz\u00far, A., Frank, A.: Covering symmetric supermodular function by graphs. Math. Program. 84, 483\u2013503 (1999)","journal-title":"Math. Program."},{"key":"9178_CR3","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","volume":"12","author":"J. Bang-Jensen","year":"1999","unstructured":"Bang-Jensen, J., Gabow, H.N., Jord\u00e1n, T., Szigeti, Z.: Edge-connectivity augmentation with partition constraints. SIAM J. Discrete Math. 12, 160\u2013207 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"9178_CR4","volume-title":"Computers and Intractability","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. Freeman, San Francisco (1979)"},{"issue":"1","key":"9178_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discrete Math. 5(1), 25\u201353 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"9178_CR6","first-page":"34","volume-title":"Mathematical Programming: State of the Art 1994","author":"A. Frank","year":"1994","unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Birge, J.R., Murty, K.G. (eds.) Mathematical Programming: State of the Art 1994, pp. 34\u201363. University of Michigan Press, Ann Arbor (1994)"},{"key":"9178_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Applications of a poset representation to edge connectivity and graph rigidity. In: Proc. 32nd IEEE Symp. Found. Comp. Sci., pp. 812\u2013821 (1991)","DOI":"10.1109\/SFCS.1991.185453"},{"key":"9178_CR8","series-title":"Network Models","first-page":"617","volume-title":"Handbook in Operations Research and Management Science","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of survivable networks. In: Handbook in Operations Research and Management Science. Network Models, vol. 7, pp. 617\u2013672. North-Holland, Amsterdam (1995)"},{"issue":"4","key":"9178_CR9","first-page":"463","volume":"11","author":"H. Ito","year":"1994","unstructured":"Ito, H.: Node-to-area connectivity of graphs. Trans. Ins. Electr. Eng. Jpn. C 11(4), 463\u2013469 (1994)","journal-title":"Trans. Ins. Electr. Eng. Jpn. C"},{"key":"9178_CR10","first-page":"89","volume-title":"Proceedings of APORS94","author":"H. Ito","year":"1995","unstructured":"Ito, H.: Node-to-area connectivity of graphs. In: Fushimi, M., Tone, K. (eds.) Proceedings of APORS94, pp. 89\u201396. World Scientific, Singapure (1995)"},{"key":"9178_CR11","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, K., Itatsu, K., Fujishige, S.: Source location problem with flow requirements in directed networks. Optim. Methods Softw. 18, 427\u2013435 (2003)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9178_CR12","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.: Edge connectivity between nodes and node-subsets. Networks 31(3), 157\u2013164 (1998)","journal-title":"Networks"},{"key":"9178_CR13","unstructured":"Kant, G.: Algorithms for drawing planar graphs. PhD thesis, Dept. of Computer Science, Utrecht University, the Netherlands (1993)"},{"key":"9178_CR14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/S0895480193243274","volume":"9","author":"M.-Y. Kao","year":"1996","unstructured":"Kao, M.-Y.: Data security equals graph connectivity. SIAM J. Discrete Math. 9, 87\u2013100 (1996)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"9178_CR15","doi-asserted-by":"crossref","first-page":"224","DOI":"10.15807\/jorsj.47.224","volume":"47","author":"H. Miwa","year":"2004","unstructured":"Miwa, H., Ito, H.: NA-edge-connectivity augmentation problems by adding edges. J. Oper. Res. Soc. Jpn. 47(4), 224\u2013243 (2004)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9178_CR16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"9178_CR17","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity of multigraphs and capacitated graphs. SIAM J. Discrete Math. 5, 54\u201366 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"9178_CR18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009739202898","volume":"1","author":"H. Nagamochi","year":"1997","unstructured":"Nagamochi, H., Ibaraki, T.: Deterministic $\\tilde{O}(nm)$ time edge-splitting in undirected graphs. J. Comb. Optim. 1, 5\u201346 (1997)","journal-title":"J. Comb. Optim."},{"issue":"6","key":"9178_CR19","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.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Inf. Proc. Lett. 80(6), 287\u2013294 (2001)","journal-title":"Inf. Proc. Lett."},{"key":"9178_CR20","unstructured":"Nutov, Z.: Approximating connectivity augmentation problems. In: Proc. of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 176\u2013185 (2005)"},{"key":"9178_CR21","doi-asserted-by":"crossref","unstructured":"Tsukiyama, S., Koike, K., Shirakawa, I.: An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floor-plan. Proc. ISCAS\u201986, pp. 321\u2013324 (1986)","DOI":"10.1142\/9789812794468_0011"},{"key":"9178_CR22","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"Watanabe, T., Nakamura, A.: Edge-connectivity augmentation problems. J. Comput. Syst. Sci. 35, 96\u2013144 (1987)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9178-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-008-9178-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-008-9178-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:01Z","timestamp":1559123101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-008-9178-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,15]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["9178"],"URL":"https:\/\/doi.org\/10.1007\/s00453-008-9178-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,15]]}}}