{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T05:00:02Z","timestamp":1649134802358},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/s0167-6377(97)00045-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"219-223","source":"Crossref","is-referenced-by-count":2,"title":["Faster approximation algorithms for weighted triconnectivity augmentation problems"],"prefix":"10.1016","volume":"21","author":[{"given":"Zeev","family":"Nutov","sequence":"first","affiliation":[]},{"given":"Michal","family":"Penn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(97)00045-X_BIB1","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\/S0167-6377(97)00045-X_BIB2","unstructured":"A. Frank, Connectivity augmentation problems in network design, in: J.R. Birge, K.G. Murty (Eds.), Mathematical Programming, State of the Art 1994, 1994, pp. 34\u201363."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB3","doi-asserted-by":"crossref","unstructured":"A. Frank, E. Tardos, An application of submodular flows, Linear Algebra Appl. 114\/115 (1989) 329\u2013348.","DOI":"10.1016\/0024-3795(89)90469-2"},{"key":"10.1016\/S0167-6377(97)00045-X_BIB4","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\/S0167-6377(97)00045-X_BIB5","unstructured":"H.N. Gabow, A representation for crossing set families with application to submodular flow problems, Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 202\u2013211."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB6","unstructured":"M. Gr\u00f6tschel, C. Monma, M. Stoer, Design of survivable networks, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds.), Handbook in Operations Research and Management Science, vol. 7, Network Models, 1993."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB8","unstructured":"T.-s. Hsu, V. Ramachandran, Smallest triconnectivity augmentation, Part 1: General graphs, 1994, manuscript."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB9","unstructured":"T.-s. Hsu, V. Ramachandran, Smallest triconnectivity augmentation, Part 2: Biconnected graphs, 1994, manuscript."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB10","first-page":"8","article-title":"On the optimal vertex connectivity augmentation","volume":"63","author":"Jordan","year":"1995","journal-title":"JCT. B"},{"key":"10.1016\/S0167-6377(97)00045-X_BIB11","unstructured":"S. Khuller, Approximation algorithms for finding highly connected subgraphs, CS-TR-3398, University of Maryland, February, 1995."},{"key":"10.1016\/S0167-6377(97)00045-X_BIB12","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1006\/jagm.1996.0052","article-title":"Improved approximation algorithms for uniform connectivity problems","volume":"21","author":"Khuller","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-6377(97)00045-X_BIB13","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/jagm.1993.1010","article-title":"Approximation algorithms for graph augmentation","volume":"14","author":"Khuller","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0167-6377(97)00045-X_BIB14","doi-asserted-by":"crossref","unstructured":"M. Penn, H. Shasha-Krupnik, Improved approximation algorithms for weighted 2 & 3 vertex connectivity augmentation problems, J. Algorithms 22 (1995) 187\u2013196.","DOI":"10.1006\/jagm.1995.0800"},{"key":"10.1016\/S0167-6377(97)00045-X_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF02523686","article-title":"An approximation algorithm for minimum-cost vertex-connectivity problems","volume":"18","author":"Ravi","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(97)00045-X_BIB16","doi-asserted-by":"crossref","unstructured":"W.T. Tutte, Connectivity in Graphs, University of Toronto Press, 1966.","DOI":"10.3138\/9781487584863"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763779700045X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763779700045X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T04:01:28Z","timestamp":1580270488000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763779700045X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S016763779700045X"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(97)00045-x","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}