{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T11:21:53Z","timestamp":1780399313823,"version":"3.54.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.tcs.2026.116060","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T16:12:43Z","timestamp":1779811963000},"page":"116060","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Parameterized approximation scheme for feedback vertex set"],"prefix":"10.1016","volume":"1081","author":[{"given":"Satyabrata","family":"Jana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soumen","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashutosh","family":"Rai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2026.116060_bib0001","doi-asserted-by":"crossref","first-page":"10","DOI":"10.3390\/a11010010","article-title":"Inapproximability of maximum biclique problems, minimum k-cut and densest at-least-k-subgraph from the small set expansion hypothesis","volume":"11","author":"Manurangsi","year":"2018","journal-title":"Algorithms"},{"key":"10.1016\/j.tcs.2026.116060_bib0002","series-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018","first-page":"2821","article-title":"An FPT algorithm beating 2-Approximation for k-Cut","author":"Gupta","year":"2018"},{"key":"10.1016\/j.tcs.2026.116060_bib0003","series-title":"61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020","first-page":"798","article-title":"A parameterized approximation scheme for min $k$-cut","author":"Lokshtanov","year":"2020"},{"key":"10.1016\/j.tcs.2026.116060_bib0004","series-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP 2018","first-page":"17:1","article-title":"Parameterized intractability of even set and shortest vector problem from gap-ETH","volume":"107","author":"Bhattacharyya","year":"2018"},{"key":"10.1016\/j.tcs.2026.116060_bib0005","series-title":"58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017","first-page":"743","article-title":"From gap-ETH to FPT-Inapproximability: clique, dominating set, and more","author":"Chalermsook","year":"2017"},{"issue":"2","key":"10.1016\/j.tcs.2026.116060_bib0006","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/17M1127211","article-title":"The constant inapproximability of the parameterized dominating set problem","volume":"48","author":"Chen","year":"2019","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.116060_bib0007","doi-asserted-by":"crossref","unstructured":"B. Lin, The parameterized complexity of the k-Biclique problem, J. ACM 65 (5) (2018) 34:1\u201334:23. https:\/\/doi.org\/10.1145\/3212622.","DOI":"10.1145\/3212622"},{"key":"10.1016\/j.tcs.2026.116060_bib0008","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.jcss.2017.11.001","article-title":"Parameterized approximation via fidelity preserving transformations","volume":"93","author":"Fellows","year":"2018","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.116060_bib0009","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.tcs.2012.12.003","article-title":"A novel parameterised approximation algorithm for minimum vertex cover","volume":"511","author":"Brankovic","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116060_bib0010","series-title":"61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020","first-page":"762","article-title":"Analysis of two-variable recurrence relations with application to parameterized approximations","author":"Kulik","year":"2020"},{"key":"10.1016\/j.tcs.2026.116060_bib0011","series-title":"Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021","first-page":"199","article-title":"FPT-Approximation for FPT problems","author":"Lokshtanov","year":"2021"},{"issue":"6","key":"10.1016\/j.tcs.2026.116060_bib0012","doi-asserted-by":"crossref","first-page":"146","DOI":"10.3390\/a13060146","article-title":"A survey on approximation in parameterized complexity: hardness and algorithms","volume":"13","author":"Feldmann","year":"2020","journal-title":"Algorithms"},{"key":"10.1016\/j.tcs.2026.116060_bib0013","series-title":"Encyclopedia of Algorithms","first-page":"756","article-title":"Fixed-Parameter approximability and hardness","author":"Kortsarz","year":"2016"},{"issue":"1","key":"10.1016\/j.tcs.2026.116060_bib0014","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","article-title":"Parameterized complexity and approximation algorithms","volume":"51","author":"Marx","year":"2008","journal-title":"Comput. J."},{"issue":"3","key":"10.1016\/j.tcs.2026.116060_bib0015","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","article-title":"A 2-Approximation algorithm for the undirected feedback vertex set problem","volume":"12","author":"Bafna","year":"1999","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"10.1016\/j.tcs.2026.116060_bib0016","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","article-title":"Vertex cover might be hard to approximate to within 2-epsilon","volume":"74","author":"Khot","year":"2008","journal-title":"J. Comput. Syst. Sci."},{"issue":"8","key":"10.1016\/j.tcs.2026.116060_bib0017","doi-asserted-by":"crossref","first-page":"2503","DOI":"10.1007\/s00453-021-00815-w","article-title":"Improved analysis of highest-degree branching for feedback vertex set","volume":"83","author":"Iwata","year":"2021","journal-title":"Algorithmica"},{"issue":"4","key":"10.1016\/j.tcs.2026.116060_bib0018","first-page":"34:1","article-title":"Detecting feedback vertex sets of size k in O$\u22c6$ (2.7k) time","volume":"18","author":"Li","year":"2022","journal-title":"ACM Trans. Algo."},{"key":"10.1016\/j.tcs.2026.116060_bib0019","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2018, August 20\u201322, 2018 - Princeton, NJ, USA","first-page":"20:1","article-title":"Mildly exponential time approximation algorithms for vertex cover, balanced separator and uniform sparsest cut","volume":"Vol. 116","author":"Manurangsi","year":"2018"},{"key":"10.1016\/j.tcs.2026.116060_bib0020","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1613\/jair.638","article-title":"Randomized algorithms for the loop cutset problem","volume":"12","author":"Becker","year":"2000","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.tcs.2026.116060_bib0021","series-title":"48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28, to September 1, 2023, Bordeaux, France","first-page":"56:1","article-title":"Parameterized approximation scheme for feedback vertex set","volume":"Vol. 272","author":"Jana","year":"2023"},{"key":"10.1016\/j.tcs.2026.116060_bib0022","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"3","key":"10.1016\/j.tcs.2026.116060_bib0023","first-page":"30","article-title":"Good lower and upper bounds on binomial coefficients","volume":"2","author":"Stanica","year":"2001","journal-title":"J. Inequalities Pure Appl. Math."},{"key":"10.1016\/j.tcs.2026.116060_bib0024","series-title":"52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, Aarhus, Denmark, July 8\u201311, 2025","first-page":"39:1","article-title":"Sampling with a black box: faster parameterized approximation algorithms for vertex deletion problems","volume":"Vol. 334","author":"Esmer","year":"2025"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003105?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526003105?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:54:00Z","timestamp":1780397640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526003105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":24,"alternative-id":["S0304397526003105"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116060","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parameterized approximation scheme for feedback vertex set","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116060","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"116060"}}