{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:05:11Z","timestamp":1759104311658,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2-3","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":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3791,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00201-9","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T11:05:14Z","timestamp":1035803114000},"page":"275-289","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A primal\u2013dual approximation algorithm for the survivable network design problem in hypergraphs"],"prefix":"10.1016","volume":"126","author":[{"given":"Liang","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00201-9_BIB1","doi-asserted-by":"crossref","unstructured":"L. Fleischer, K. Jain, D.P. Williamson, An iterative rounding 2-approximation algorithms for the element connectivity problem, in: Proceedings of FOCS 2001.","DOI":"10.1109\/SFCS.2001.959908"},{"key":"10.1016\/S0166-218X(02)00201-9_BIB2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","article-title":"Maximal flow through a network","volume":"8","author":"Ford","year":"1956","journal-title":"Canad. J. Math."},{"issue":"2","key":"10.1016\/S0166-218X(02)00201-9_BIB3","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00201-9_BIB4","series-title":"Approximation Algorithms for NP-hard Problems, PWS","first-page":"144","article-title":"The primal\u2013dual method for approximation algorithms and its application to network design problems","author":"Goemans","year":"1997"},{"key":"10.1016\/S0166-218X(02)00201-9_BIB5","unstructured":"M.X. Goemans, A.V. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, D.P. Williamson, Improved approximation algorithms for network design problems, in: Proceedings of the SODA 1994, pp. 223\u2013232."},{"key":"10.1016\/S0166-218X(02)00201-9_BIB6","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","article-title":"A new approach to the maximum flow problem","volume":"35","author":"Goldberg","year":"1988","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/S0166-218X(02)00201-9_BIB7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","article-title":"A factor 2 approximation algorithm for the generalized Steiner network problem","volume":"21","author":"Jain","year":"2001","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(02)00201-9_BIB8","unstructured":"K. Jain, I. M\u0103ndoiu, V.V. Vazirani, D.P. Williamson, A primal\u2013dual schema based approximation algorithm for the element connectivity problem, in: Proceedings of the SODA 1999, pp. 484\u2013489."},{"year":"1998","series-title":"Multicast Networking and Applications","author":"Miller","key":"10.1016\/S0166-218X(02)00201-9_BIB9"},{"key":"10.1016\/S0166-218X(02)00201-9_BIB10","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\/S0166-218X(02)00201-9_BIB11","doi-asserted-by":"crossref","unstructured":"R. Ravi, D.P. Williamson, Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems, manuscript, July 2001.","DOI":"10.1007\/s00453-002-0970-9"},{"key":"10.1016\/S0166-218X(02)00201-9_BIB12","unstructured":"K. Takeshita, T. Fujito, T. Watanabe, On primal\u2013dual approximation algorithms for several hypergraph problems, IPSJ Math. Model. Problem Solving 23 (3) (1999) 13\u201318 (in Japanese)."},{"key":"10.1016\/S0166-218X(02)00201-9_BIB13","unstructured":"D.P. Williamson, The primal\u2013dual method for approximation algorithms, Math. Program., to appear."},{"issue":"3","key":"10.1016\/S0166-218X(02)00201-9_BIB14","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF01299747","article-title":"A primal\u2013dual approximation algorithm for generalized Steiner network problems","volume":"15","author":"Williamson","year":"1995","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(02)00201-9_BIB15","unstructured":"L. Zhao, H. Nagamochi, T. Ibaraki, A note on approximating the survivable network design problem in hypergraphs, IEICE Trans. Inform. Systems E85-D (2) (2002), 322\u2013326."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002019?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002019?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:12Z","timestamp":1759060632000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002019"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":15,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002019"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00201-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2003,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A primal\u2013dual approximation algorithm for the survivable network design problem in hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(02)00201-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}