{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:00:46Z","timestamp":1729670446089,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2005.1465066","type":"proceedings-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T17:52:28Z","timestamp":1122486748000},"page":"2231-2234","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph"],"prefix":"10.1109","author":[{"given":"S.","family":"Taoka","sequence":"first","affiliation":[]},{"given":"T.","family":"Watanabe","sequence":"additional","affiliation":[]},{"given":"T.","family":"Mashima","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(87)90038-9"},{"article-title":"a study on approximation algorithms for graph connectivity augmentation problems","year":"2003","author":"tamura","key":"17"},{"year":"0","key":"23"},{"year":"0","key":"18"},{"key":"15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","article-title":"linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs","volume":"1563","author":"preis","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"year":"0","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1995.521474"},{"key":"14","first-page":"179","article-title":"constructing a cactus for minimum cuts of a graph in o(mn + n2 log n) time and o(m) space","volume":"e86 d","author":"nagamochi","year":"2003","journal-title":"IEICE Trans Fundamentals"},{"key":"11","first-page":"937","article-title":"a uniform framework for approximating weighted connectivity problems","author":"khuller","year":"1999","journal-title":"Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/174652.174654"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1993.394287"},{"journal-title":"Graph Algorithms","year":"1979","author":"even","key":"3"},{"year":"0","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"1","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","article-title":"a survey of heuristics for the weighted matching problem","volume":"13","author":"avis","year":"1983","journal-title":"Networks"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1010"},{"key":"7","first-page":"202","article-title":"a representation for crossing set families with applications to submodular flow problems","author":"gabow","year":"1993","journal-title":"Proc 4th ACM Symposium on Discrete Algorithms"},{"year":"0","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321942"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/0210019"},{"year":"0","key":"9"},{"key":"8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1006\/jcss.1995.1022","article-title":"a matroid approach to finding edge connectivity and packing arborescences","volume":"50","author":"gabow","year":"1996","journal-title":"Journal of Computer and System Sciences"}],"event":{"name":"2005 IEEE International Symposium on Circuits and Systems","location":"Kobe, Japan"},"container-title":["2005 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9898\/31469\/01465066.pdf?arnumber=1465066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T21:35:27Z","timestamp":1497648927000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1465066\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/iscas.2005.1465066","relation":{},"subject":[]}}