{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T04:40:09Z","timestamp":1681015209204},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4702,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0304-3975(99)00043-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:13:43Z","timestamp":1027606423000},"page":"107-116","source":"Crossref","is-referenced-by-count":2,"title":["Approximating minimum feedback vertex sets in hypergraphs"],"prefix":"10.1016","volume":"246","author":[{"given":"Toshihiro","family":"Fujito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00043-2_BIB1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proceedings of the 33rd FOCS, IEEE, Los Alamitos, 1992, pp. 14\u201323.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB2","doi-asserted-by":"crossref","unstructured":"V. Bafna, P. Berman, T. Fujito, Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs, Proceedings of the sixth ISAAC, Lecture Notes in Computer Science, vol. 1004, Springer, Berlin, 1995, pp. 142\u2013151.","DOI":"10.1007\/BFb0015417"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB3","doi-asserted-by":"crossref","unstructured":"R. Bar-Yehuda, S. Even, A local-ratio theorem for approximating the weighted vertex cover problem, Annals of Discrete Mathematics, vol. 25, North-Holland, Amsterdam, 1985, pp. 27\u201346.","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB4","unstructured":"R. Bar-Yehuda, D. Geiger, J. Naor, R.M. Roth, Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference, Proceedings of the fifth SODA, ACM, New York, 1994, pp. 344\u2013354."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB5","doi-asserted-by":"crossref","unstructured":"A. Becker, D. Geiger, Approximation algorithms for the loop cutset problem, Proceedings of the 10th Conference on Uncertainty in AI, Morgan Kaufman, 1994, pp. 60\u201368.","DOI":"10.1016\/B978-1-55860-332-5.50013-4"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.5486\/PMD.1962.9.1-2.02","article-title":"On the maximal number of disjoint circuits of a graph","volume":"9","author":"Erd\u0151s","year":"1962","journal-title":"Publ. Math. Debrechen"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB7","doi-asserted-by":"crossref","unstructured":"T. Fujito, A primal-dual approach to approximation of node-deletion problems for matroidal properties, Proceedings of 24th ICALP, Lecture Notes in Computer Science, vol. 1256, Springer, Berlin, 1997, pp. 749\u2013759.","DOI":"10.1007\/3-540-63165-8_228"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB9","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad, Some optimal in-approximability results, Proceedings of the 29th STOC, ACM, New York, 1997, pp. 1\u201310.","DOI":"10.1145\/258533.258536"},{"issue":"3","key":"10.1016\/S0304-3975(99)00043-2_BIB10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1137\/0211045","article-title":"Approximation algorithms for the set covering and vertex cover problems","volume":"11","author":"Hochbaum","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB11","unstructured":"D.H. Hochbaum (Ed.), Approximation Algorithm for NP-Hard Problems, PWS, Boston, 1996."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB12","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB13","unstructured":"L. Lov\u00e1sz, The matroid matching problem, Algebraic Methods in Graph Theory, vol. 2, North-Holland, Amsterdam, 1981, pp. 495\u2013518."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The node-deletion problem for hereditary properties is NP-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB15","doi-asserted-by":"crossref","unstructured":"C. Lund, M. Yannakakis, The approximation of maximum subgraph problems, Proceedings of the 20th ICALP, Lecture Notes in Computer Science, vol. 700, Springer, Berlin, 1993, pp. 40\u201351.","DOI":"10.1007\/3-540-56939-1_60"},{"key":"10.1016\/S0304-3975(99)00043-2_BIB16","unstructured":"B. Monien, R. Schulz, Four approximation algorithms for the feedback vertex set problem, Proceedings of the seventh Conference on Graph Theoretic Concepts of Computer Science, 1981, pp. 315\u2013326."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00290149","article-title":"Ramsey numbers and an approximation algorithm for the vertex cover problem","volume":"22","author":"Monien","year":"1985","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00043-2_BIB18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T03:59:40Z","timestamp":1681012780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0304397599000432"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00043-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}