Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

2006 ◽  
pp. 320-331 ◽  
Author(s):  
Michael Dom ◽  
Jiong Guo ◽  
Falk Hüffner ◽  
Rolf Niedermeier ◽  
Anke Truß
Keyword(s):  
Fixed Parameter Tractability ◽  
Fixed Parameter ◽  
Feedback Set

scholarly journals Fixed-parameter tractability results for feedback set problems in tournaments

2010 ◽  
Vol 8 (1) ◽  
pp. 76-86 ◽  
Author(s):  
Michael Dom ◽  
Jiong Guo ◽  
Falk Hüffner ◽  
Rolf Niedermeier ◽  
Anke Truss
Keyword(s):  
Fixed Parameter Tractability ◽  
Fixed Parameter ◽  
Feedback Set

scholarly journals Fixed-parameter tractability and lower bounds for stabbing problems

2013 ◽  
Vol 46 (7) ◽  
pp. 839-860 ◽  
Author(s):  
Panos Giannopoulos ◽  
Christian Knauer ◽  
Günter Rote ◽  
Daniel Werner
Keyword(s):  
Lower Bounds ◽  
Fixed Parameter Tractability ◽  
Fixed Parameter

Fixed-parameter tractability for the tree assembly problem

2021 ◽  
Author(s):  
Feng Shi ◽  
Jie You ◽  
Zhen Zhang ◽  
Jingyi Liu ◽  
Jianxin Wang
Keyword(s):  
Fixed Parameter Tractability ◽  
Fixed Parameter ◽  
Assembly Problem

Fixed-parameter tractability and data reduction for multicut in trees

Networks ◽  
2005 ◽  
Vol 46 (3) ◽  
pp. 124-135 ◽  
Author(s):  
Jiong Guo ◽  
Rolf Niedermeier
Keyword(s):  
Data Reduction ◽  
Fixed Parameter Tractability ◽  
Fixed Parameter

scholarly journals Fixed-Parameter Tractability of Satisfying Beyond the Number of Variables

Algorithmica ◽  
2012 ◽  
Vol 68 (3) ◽  
pp. 739-757 ◽  
Author(s):  
Robert Crowston ◽  
Gregory Gutin ◽  
Mark Jones ◽  
Venkatesh Raman ◽  
Saket Saurabh ◽  
...  
Keyword(s):  
Fixed Parameter Tractability ◽  
Fixed Parameter

scholarly journals Finding Points in General Position

2017 ◽  
Vol 27 (04) ◽  
pp. 277-296 ◽  
Author(s):  
Vincent Froese ◽  
Iyad Kanj ◽  
André Nichterlein ◽  
Rolf Niedermeier
Keyword(s):  
Lower Bound ◽  
General Position ◽  
Subset Selection ◽  
Selection Problem ◽  
Fixed Parameter Tractability ◽  
Maximum Cardinality ◽  
Exponential Time ◽  
Running Time ◽  
Fixed Parameter ◽  
Set Of Points

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.

Sign in / Sign up

Export Citation Format

Share Document