{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:12:07Z","timestamp":1758823927150},"reference-count":32,"publisher":"EDP Sciences","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1051\/ro\/2015060","type":"journal-article","created":{"date-parts":[[2015,11,25]],"date-time":"2015-11-25T02:43:47Z","timestamp":1448419427000},"page":"979-994","source":"Crossref","is-referenced-by-count":2,"title":["Super-polynomial approximation branching algorithms"],"prefix":"10.1051","volume":"50","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emeric","family":"Tourniaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi, Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer-Verlag, Berlin (1999).","DOI":"10.1007\/978-3-642-58412-1"},{"key":"R2","first-page":"167","volume":"83","author":"Becker","year":"1996"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"E. Bonnet, B. Escoffier, E. Kim and V.Th. Paschos, On subexponential and fpt-time inapproximability. In Proc. of International Workshop on Parameterized and Exact Computation, IPEC\u201913, edited by G. Gutin and S. Szeider. Vol. 8246 of Lect. Notes Comput. Sci. Springer-Verlag (2013) 54\u201365.","DOI":"10.1007\/978-3-319-03898-8_6"},{"key":"R4","first-page":"950","volume":"109","author":"Bourgeois","year":"2009"},{"key":"R5","first-page":"1954","volume":"159","author":"Bourgeois","year":"2011"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"L. Brankovic and H. Fernau, Combining two worlds: parameterized approximation for vertex cover. In Proc. of International Symposium on Algorithms and Computation, ISAAC\u201910, edited by O. Cheong and K.-Y. Chwa ans K. Park. Vol. 6506 of Lect. Notes Comput. Sci. Spinger-Verlag (2010) 390\u2013402.","DOI":"10.1007\/978-3-642-17517-6_35"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"L. Cai and X. Huang, Fixed-parameter approximation: conceptual framework and approximability results. In Proc. of International Workshop on Parameterized and Exact Computation, IWPEC\u201906, edited by H.L. Bodlaender and M.A. Langston. Vol. 4169 of Lect. Notes Comput. Sci. Springer-Verlag (2006) 96\u2013108.","DOI":"10.1007\/11847250_9"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Y. Chen, M. Grohe and M. Gr\u00fcber, On parameterized approximability. In Proc. of International Workshop on Parameterized and Exact Computation, IWPEC\u201906, edited by H.L. Bodlaender and M.A. Langston. Vol. 4169 of Lect. Notes Comput. Sci. Springer-Verlag (2006) 109\u2013120.","DOI":"10.1007\/11847250_10"},{"key":"R9","first-page":"674","volume":"28","author":"Della Croce","year":"2014"},{"key":"R10","first-page":"3701","volume":"411","author":"Cygan","year":"2010"},{"key":"R11","first-page":"81","volume":"113","author":"Dantsin","year":"2002"},{"key":"R12","first-page":"403","volume":"35","author":"Della Croce","year":"2007"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"I. Dinur and M. Safra, The importance of being biased. In Proc. of STOC\u201902 (2002) 33\u201342.","DOI":"10.1145\/509907.509915"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows, Parameterized complexity. Monogr. Comput. Sci. Springer, New York (1999).","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows and C. McCartin, Parameterized approximation problems. In Proc. of International Workshop on Parameterized and Exact Computation, IWPEC\u201906, edited by H.L. Bodlaender and M.A. Langston. Vol. 4169 of Lect. Notes Comput. Sci. Springer-Verlag (2006) 121\u2013129.","DOI":"10.1007\/11847250_11"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"B. Escoffier, V. Th. Paschos and E. Tourniaire, Approximating max sat by moderately exponential and parameterized algorithms. In Proc. of Theory and Applications of Models of Computation, TAMC\u201912, edited by M. Agrawal, S. Barry Cooper and A. Li. Vol. 7287 of Lect. Notes Comput. Sci. Springer-Verlag (2012) 202\u2013213.","DOI":"10.1007\/978-3-642-29952-0_23"},{"key":"R17","first-page":"174","volume":"41","author":"Feige","year":"2001"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, A. Kulik, F.A. Rosamond and H. Shachnai, Parameterized approximation via fidelity preserving transformations. In Proc. of ICALP\u201912, edited by A. Czumaj, K. Mehlhorn, A. Pitts and R. Wattenhofer. Vol. 7391 of Lect. Notes Comput. Sci. Springer-Verlag (2012) 351\u2013362.","DOI":"10.1007\/978-3-642-31594-7_30"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"F.V. Fomin and D. Kratsch, Exact exponential algorithms. EATCS. Springer-Verlag (2010).","DOI":"10.1007\/978-3-642-16533-7"},{"key":"R20","unstructured":"F.V. Fomin and Y. Villanger, Finding induced subgraphs via minimal triangulations. In Proc. of International Symposium on Theoretical Aspects of Computer Science, STACS\u201910, edited by J.-Y. Marion and T. Schwentick. Nancy, France (2010) 383\u2013394."},{"key":"R21","first-page":"1","volume":"56","author":"Fomin","year":"2009"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"M. F\u00fcrer, S. Gaspers and S.P. Kasiviswanathan, An exponential time 2-approximation algorithm for bandwidth. In Proc. of International Workshop on Parameterized and Exact Computation, IWPEC\u201909. Vol. 5917 of Lect. Notes Comput. Sci. Springer (2009).","DOI":"10.1007\/978-3-642-11269-0_14"},{"key":"R23","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)."},{"key":"R24","first-page":"1115","volume":"42","author":"Goemans","year":"1995"},{"key":"R25","first-page":"798","volume":"48","author":"H\u00e5stad","year":"2001"},{"key":"R26","first-page":"367","volume":"62","author":"Impagliazzo","year":"2001"},{"key":"R27","first-page":"512","volume":"63","author":"Impagliazzo","year":"2001"},{"key":"R28","first-page":"133","volume":"10","author":"J\u00e4ger","year":"2005"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"R.M. Karp, Reducibility among combinatorial problems. Complexity of computer computations, edited by R.E. Miller and J.W. Thatcher. Plenum Press, New York (1972) 85\u2013103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R30","first-page":"60","volume":"51","author":"Marx","year":"2008"},{"key":"R31","first-page":"425","volume":"43","author":"Papadimitriou","year":"1991"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"I. Razgon, Computing minimum directed feedback vertex set in o(1.9977n). In Proc. of Italian Conference in Theoretical Computer Science, ICTCS\u201907, edited by G.F. Italiano, E. Moggi and L. Laura. World Scientific (2007) 70\u201381.","DOI":"10.1142\/9789812770998_0010"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015060\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T18:09:24Z","timestamp":1567361364000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":32,"journal-issue":{"issue":"4-5"},"alternative-id":["ro151108"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015060","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}