{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T11:36:44Z","timestamp":1719920204749},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"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":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1016\/j.jcss.2021.09.001","type":"journal-article","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T15:36:27Z","timestamp":1632238587000},"page":"26-40","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["(In)approximability of maximum minimal FVS"],"prefix":"10.1016","volume":"124","author":[{"given":"Louis","family":"Dublois","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6943-856X","authenticated-orcid":false,"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8482-1521","authenticated-orcid":false,"given":"Mehdi","family":"Khosravian Ghadikolaei","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Lampis","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Melissinos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/j.jcss.2021.09.001_br0010","doi-asserted-by":"crossref","first-page":"2799","DOI":"10.1007\/s00453-017-0346-9","article-title":"Upper domination: towards a dichotomy through boundary properties","volume":"80","author":"AbouEisha","year":"2018","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2021.09.001_br0020","series-title":"STACS","first-page":"58:1","article-title":"Grundy coloring & friends, half-graphs, bicliques","volume":"vol. 154","author":"Aboulker","year":"2020"},{"issue":"1","key":"10.1016\/j.jcss.2021.09.001_br0030","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0890-5401(03)00060-9","article-title":"The lazy bureaucrat scheduling problem","volume":"184","author":"Arkin","year":"2003","journal-title":"Inf. Comput."},{"issue":"10","key":"10.1016\/j.jcss.2021.09.001_br0040","doi-asserted-by":"crossref","first-page":"3993","DOI":"10.1007\/s00453-018-0512-8","article-title":"New tools and connections for exponential-time approximation","volume":"81","author":"Bansal","year":"2019","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcss.2021.09.001_br0050","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.tcs.2017.05.042","article-title":"J\u00e9r\u00f4me Monnot, and Vangelis Th. Paschos. The many facets of upper domination","volume":"717","author":"Bazgan","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2021.09.001_br0060","series-title":"28th Annual European Symposium on Algorithms","first-page":"14:1","article-title":"Grundy distinguishes treewidth from pathwidth","volume":"vol. 173","author":"Belmonte","year":"2020"},{"key":"10.1016\/j.jcss.2021.09.001_br0070","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ic.2014.12.008","article-title":"Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth","volume":"243","author":"Bodlaender","year":"2015","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jcss.2021.09.001_br0080","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.jcss.2017.09.009","article-title":"Time-approximation trade-offs for inapproximable problems","volume":"92","author":"Bonnet","year":"2018","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2021.09.001_br0090","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.dam.2014.06.001","article-title":"On the max min vertex cover problem","volume":"196","author":"Boria","year":"2015","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"10.1016\/j.jcss.2021.09.001_br0100","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1016\/j.ipl.2009.05.002","article-title":"Approximation of min coloring by moderately exponential algorithms","volume":"109","author":"Bourgeois","year":"2009","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.jcss.2021.09.001_br0110","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.endm.2017.10.030","article-title":"Weighted upper domination number","volume":"62","author":"Boyaci","year":"2017","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.jcss.2021.09.001_br0120","series-title":"FOCS","first-page":"370","article-title":"Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses","author":"Chalermsook","year":"2013"},{"issue":"3","key":"10.1016\/j.jcss.2021.09.001_br0130","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","article-title":"On the computational complexity of upper fractional domination","volume":"27","author":"Cheston","year":"1990","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10.1016\/j.jcss.2021.09.001_br0140","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","article-title":"Linear time solvable optimization problems on graphs of bounded clique-width","volume":"33","author":"Courcelle","year":"2000","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2021.09.001_br0150","series-title":"Parameterized Algorithms","author":"Cygan","year":"2015"},{"issue":"16","key":"10.1016\/j.jcss.2021.09.001_br0160","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/j.ipl.2009.05.003","article-title":"Exponential-time approximation of weighted set cover","volume":"109","author":"Cygan","year":"2009","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.jcss.2021.09.001_br0170","series-title":"FOCS","first-page":"150","article-title":"Solving connectivity problems parameterized by treewidth in single exponential time","author":"Cygan","year":"2011"},{"issue":"40\u201342","key":"10.1016\/j.jcss.2021.09.001_br0180","doi-asserted-by":"crossref","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","article-title":"Exact and approximate bandwidth","volume":"411","author":"Cygan","year":"2010","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2021.09.001_br0190","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/A:1008765214400","article-title":"A note on the approximation of a minimum-weight maximal independent set","volume":"14","author":"Demange","year":"1999","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.jcss.2021.09.001_br0200","series-title":"31st International Symposium on Algorithms and Computation","first-page":"3:1","article-title":"(In)approximability of Maximum Minimal FVS","volume":"vol. 181","author":"Dublois","year":"2020"},{"key":"10.1016\/j.jcss.2021.09.001_br0210","author":"Dublois"},{"key":"10.1016\/j.jcss.2021.09.001_br0220","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2014.10.039","article-title":"Approximating MAX SAT by moderately exponential and parameterized algorithms","volume":"560","author":"Escoffier","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2021.09.001_br0230","series-title":"14th International Symposium on Parameterized and Exact Computation","first-page":"13:1","article-title":"Parameterized algorithms for maximum cut with connectivity constraints","volume":"vol. 148","author":"Eto","year":"2019"},{"key":"10.1016\/j.jcss.2021.09.001_br0240","series-title":"STACS","first-page":"37:1","article-title":"Sub-exponential approximation schemes for csps: from dense to almost sparse","volume":"vol. 47","author":"Fotakis","year":"2016"},{"issue":"2","key":"10.1016\/j.jcss.2021.09.001_br0250","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.ejor.2017.03.061","article-title":"An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem","volume":"262","author":"Furini","year":"2017","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.jcss.2021.09.001_br0260","series-title":"FCT","first-page":"171","article-title":"The lazy bureaucrat problem with common arrivals and deadlines: approximation and mechanism design","volume":"vol. 8070","author":"Gourv\u00e8s","year":"2013"},{"key":"10.1016\/j.jcss.2021.09.001_br0270","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.tcs.2019.09.025","article-title":"On the maximum weight minimal separator","volume":"796","author":"Hanaka","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2021.09.001_br0280","series-title":"Topics in Theoretical Computer Science - Third IFIP WG 1.8 International Conference, Proceedings","first-page":"32","article-title":"On the complexity of the upper r-tolerant edge cover problem","volume":"vol. 12281","author":"Harutyunyan Mehdi Khosravian Ghadikolaei","year":"2020"},{"key":"10.1016\/j.jcss.2021.09.001_br0290","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03f5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."},{"key":"10.1016\/j.jcss.2021.09.001_br0300","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.tcs.2019.10.045","article-title":"Algorithmic aspects of upper paired-domination in graphs","volume":"804","author":"Henning","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jcss.2021.09.001_br0310","article-title":"On upper transversals in 3-uniform hypergraphs","volume":"25","author":"Henning","year":"2018","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.jcss.2021.09.001_br0320","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejc.2019.01.002","article-title":"Upper transversals in hypergraphs","volume":"78","author":"Henning","year":"2019","journal-title":"Eur. J. Comb."},{"issue":"1","key":"10.1016\/j.jcss.2021.09.001_br0330","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10878-019-00456-4","article-title":"Bounds on upper transversals in hypergraphs","volume":"39","author":"Henning","year":"2020","journal-title":"J. Comb. Optim."},{"issue":"1","key":"10.1016\/j.jcss.2021.09.001_br0340","doi-asserted-by":"crossref","first-page":"23","DOI":"10.7155\/jgaa.00383","article-title":"An improved algorithm for parameterized edge dominating set problem","volume":"20","author":"Iwaide","year":"2016","journal-title":"J. Graph Algorithms Appl."},{"issue":"1\u20133","key":"10.1016\/j.jcss.2021.09.001_br0350","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(90)90349-M","article-title":"Chordal graphs and upper irredundance, upper domination and independence","volume":"86","author":"Jacobson","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcss.2021.09.001_br0360","series-title":"WAOA","first-page":"202","article-title":"Improved (in-)approximability bounds for d-scattered set","volume":"vol. 11926","author":"Katsikarelis","year":"2019"},{"issue":"2","key":"10.1016\/j.jcss.2021.09.001_br0370","doi-asserted-by":"crossref","first-page":"65","DOI":"10.7155\/jgaa.00519","article-title":"Weighted upper edge cover: complexity and approximability","volume":"24","author":"Khoshkhah Mehdi Khosravian Ghadikolaei","year":"2020","journal-title":"J. Graph Algorithms Appl."},{"issue":"3","key":"10.1016\/j.jcss.2021.09.001_br0380","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1051\/ita:2001121","article-title":"On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem","volume":"35","author":"Mishra","year":"2001","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10.1016\/j.jcss.2021.09.001_br0390","series-title":"Graph-Theoretic Concepts in Computer Science - 38th International Workshop","first-page":"172","article-title":"Parameterized algorithms for even cycle transversal","volume":"vol. 7551","author":"Misra","year":"2012"},{"issue":"1","key":"10.1016\/j.jcss.2021.09.001_br0400","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","article-title":"On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three","volume":"72","author":"Ueno","year":"1988","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/j.jcss.2021.09.001_br0410","doi-asserted-by":"crossref","first-page":"2440","DOI":"10.1137\/16M109017X","article-title":"Maximum minimal vertex cover parameterized by vertex cover","volume":"31","author":"Zehavi","year":"2017","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.jcss.2021.09.001_br0420","doi-asserted-by":"crossref","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","article-title":"Linear degree extractors and the inapproximability of max clique and chromatic number","volume":"3","author":"Zuckerman","year":"2007","journal-title":"Theory Comput."},{"issue":"3","key":"10.1016\/j.jcss.2021.09.001_br0430","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1002\/jgt.3190200313","article-title":"An induced subgraph characterization of domination perfect graphs","volume":"20","author":"Zvervich","year":"1995","journal-title":"J. Graph Theory"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000021000829?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000021000829?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T17:08:32Z","timestamp":1672160912000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000021000829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3]]},"references-count":43,"alternative-id":["S0022000021000829"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.jcss.2021.09.001","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2022,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"(In)approximability of maximum minimal FVS","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2021.09.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}
