{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:34Z","timestamp":1781345674177,"version":"3.54.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00218-4","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"83-113","source":"Crossref","is-referenced-by-count":51,"title":["An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree"],"prefix":"10.1016","volume":"126","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00218-4_BIB1","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, T. Jord\u00e1n, R. Ravi, On 2-coverings and 2-packings in laminar families, Lecture Notes in Computer Science, Vol. 1643, Springer, Berlin, 1999, pp. 510\u2013520.","DOI":"10.1007\/3-540-48481-7_44"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB2","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, A. Seb\u00f6, Z. Szigeti, An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs, Lecture Notes in Computer Science, Vol. 1412, Springer, Berlin, 1998, pp. 126\u2013136.","DOI":"10.1007\/3-540-69346-7_10"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB3","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1996, pp. 292\u2013301.","DOI":"10.1109\/SFCS.1996.548488"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB4","series-title":"Studies in Discrete Optimization","first-page":"290","article-title":"On the structure of a family of minimal weighted cuts in a graph","author":"Dinits","year":"1976"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB5","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00218-4_BIB6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/0210019","article-title":"Approximation algorithms for several graph augmentation problems","volume":"10","author":"Frederickson","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00218-4_BIB7","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, Applications of a poset representation to edge connectivity and graph rigidity, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1991, pp. 812\u2013821.","DOI":"10.1109\/SFCS.1991.185453"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB8","unstructured":"H.N. Gabow, A representation for crossing set families with applications to submodular flow problems, Proceedings of the Fourth ACM Symposium on Discrete Algorithms, 1993, pp. 202\u2013211."},{"key":"10.1016\/S0166-218X(02)00218-4_BIB9","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00218-4_BIB10","series-title":"Approximation Algorithms","first-page":"236","article-title":"Approximation algorithms for finding highly connected subgraphs","author":"Khuller","year":"1997"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB11","doi-asserted-by":"crossref","unstructured":"S. Khuller, R. Thurimella, Approximation algorithms for graph augmentation, Proceedings of the 19th International Colloquium on Automata, Languages and Programming Conference, 1992, pp. 330\u2013341.","DOI":"10.1007\/3-540-55719-9_85"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB12","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/174652.174654","article-title":"Biconnectivity approximations and graph carvings","volume":"41","author":"Khuller","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB13","doi-asserted-by":"crossref","unstructured":"S. Micali, V.V. Vazirani, An O(|V||E|) algorithm for finding maximum matching in general graph, Proceedings of the 21st IEEE Symposium on Foundations of Computer Science, 1980, pp. 17\u201327.","DOI":"10.1109\/SFCS.1980.12"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB14","doi-asserted-by":"crossref","unstructured":"H. Nagamochi, T. Ibaraki, An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree, Lecture Notes in Computer Science, Vol. 1627, Springer, Berlin, 1999, pp. 31\u201340.","DOI":"10.1007\/3-540-48686-0_3"},{"key":"10.1016\/S0166-218X(02)00218-4_BIB15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03167346","article-title":"A fast algorithm for cactus representations of minimum cuts","volume":"17","author":"Nagamochi","year":"2000","journal-title":"J. Jpn. Soc. Ind. Appl. Math."},{"key":"10.1016\/S0166-218X(02)00218-4_BIB16","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00218-4_BIB17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:37:53Z","timestamp":1580877473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002184"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00218-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}