scholarly journals From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

2020 ◽  
Vol 49 (4) ◽  
pp. 772-810
Author(s):  
Parinya Chalermsook ◽  
Marek Cygan ◽  
Guy Kortsarz ◽  
Bundit Laekhanukit ◽  
Pasin Manurangsi ◽  
...  
2011 ◽  
Vol 412 (50) ◽  
pp. 6982-7000 ◽  
Author(s):  
Marek Cygan ◽  
Geevarghese Philip ◽  
Marcin Pilipczuk ◽  
Michał Pilipczuk ◽  
Jakub Onufry Wojtaszczyk

2012 ◽  
Vol 186 ◽  
pp. 1-37 ◽  
Author(s):  
Wolfgang Dvořák ◽  
Reinhard Pichler ◽  
Stefan Woltran

2017 ◽  
Vol 27 (04) ◽  
pp. 277-296 ◽  
Author(s):  
Vincent Froese ◽  
Iyad Kanj ◽  
André Nichterlein ◽  
Rolf Niedermeier

We study the General Position Subset Selection problem: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-hard, APX-hard, and present several fixed-parameter tractability results for the problem as well as a subexponential running time lower bound based on the Exponential Time Hypothesis.


2009 ◽  
Vol 38 (5) ◽  
pp. 2007-2020 ◽  
Author(s):  
Yngve Villanger ◽  
Pinar Heggernes ◽  
Christophe Paul ◽  
Jan Arne Telle

Author(s):  
Serge Gaspers ◽  
Joachim Gudmundsson ◽  
Michael Horton ◽  
Stefan Rümmele

Optimization ◽  
2013 ◽  
Vol 62 (8) ◽  
pp. 1019-1036
Author(s):  
Bruno Escoffier ◽  
Vangelis Th. Paschos ◽  
Emeric Tourniaire

Sign in / Sign up

Export Citation Format

Share Document