{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:05:01Z","timestamp":1730271901854,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2003.1204999","type":"proceedings-article","created":{"date-parts":[[2003,11,21]],"date-time":"2003-11-21T01:19:26Z","timestamp":1069377566000},"page":"III-236-III-239","source":"Crossref","is-referenced-by-count":0,"title":["A 2-approximation algorithm FSA+1 to (\u03bb+1)-edge-connect a specified set of vertices in a \u03bb-edge-connected graph"],"prefix":"10.1109","volume":"3","author":[{"given":"S.","family":"Taoka","sequence":"first","affiliation":[]},{"given":"T.","family":"Mashima","sequence":"additional","affiliation":[]},{"given":"T.","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ISCAS.1995.521474"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1137\/1.9781611970265"},{"key":"ref12","first-page":"1242","article-title":"Construction robust networks by means of graph augmentation problems","volume":"73 a","author":"watanabe","year":"1990","journal-title":"Trans IEICE of Japan"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/3-540-56279-6_55"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ISCAS.1993.394287"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/0022-0000(87)90038-9"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ISCAS.1989.100359"},{"key":"ref17","first-page":"424","article-title":"Approximation algorithms for the 3-edge-connectivity augmentation problem of graphs","author":"watanabe","year":"1992","journal-title":"Proc IEEE Asia Pacific Conference Circuits Systems"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/ISCAS.1993.693150"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/BF01585864"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/SFCS.1991.185453"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/s004930170004"},{"key":"ref5","first-page":"223","article-title":"Improved approximation algorithms for network design problems","author":"goemans","year":"1994","journal-title":"Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1006\/jagm.1993.1010"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/BF01074775"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1137\/0210019"},{"year":"1979","author":"even","article-title":"Graph Algorithms","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/174652.174654"}],"event":{"acronym":"ISCAS-03","name":"ISCAS 2003. International Symposium on Circuits and Systems","location":"Bangkok, Thailand"},"container-title":["Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8570\/27130\/01204999.pdf?arnumber=1204999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T17:19:18Z","timestamp":1489425558000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1204999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/iscas.2003.1204999","relation":{},"subject":[]}}