scholarly journals Dominating set is fixed parameter tractable in claw-free graphs

2011 ◽  
Vol 412 (50) ◽  
pp. 6982-7000 ◽  
Author(s):  
Marek Cygan ◽  
Geevarghese Philip ◽  
Marcin Pilipczuk ◽  
Michał Pilipczuk ◽  
Jakub Onufry Wojtaszczyk
Keyword(s):  
Dominating Set ◽  
Fixed Parameter Tractable ◽  
Fixed Parameter

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 ◽  
...  
Keyword(s):  
Dominating Set ◽  
Fixed Parameter Tractable ◽  
Exponential Time ◽  
Exponential Time Hypothesis ◽  
Fixed Parameter

scholarly journals Towards fixed-parameter tractable algorithms for abstract argumentation

2012 ◽  
Vol 186 ◽  
pp. 1-37 ◽  
Author(s):  
Wolfgang Dvořák ◽  
Reinhard Pichler ◽  
Stefan Woltran
Keyword(s):  
Fixed Parameter Tractable ◽  
Abstract Argumentation ◽  
Fixed Parameter

scholarly journals Interval Completion Is Fixed Parameter Tractable

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

When is Red-Blue Nonblocker Fixed-Parameter Tractable?

2018 ◽  
pp. 515-528
Author(s):  
Serge Gaspers ◽  
Joachim Gudmundsson ◽  
Michael Horton ◽  
Stefan Rümmele
Keyword(s):  
Fixed Parameter Tractable ◽  
Fixed Parameter

scholarly journals Threshold Treewidth and Hypertree Width

2020 ◽  
Author(s):  
Robert Ganian ◽  
Andre Schidler ◽  
Manuel Sorge ◽  
Stefan Szeider
Keyword(s):  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Structural Parameters ◽  
Exact Methods ◽  
Fixed Parameter Tractable ◽  
Computational Costs ◽  
Fixed Parameter ◽  
Account Information ◽  
The Given ◽  
Theoretical Results

Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in polynomial time. However, here the order of the polynomial in the running time depends on the width, and this is known to be unavoidable; therefore, the problem is not fixed-parameter tractable parameterized by either of these width measures. Here we introduce an enhancement of tree and hypertree width through a novel notion of thresholds, allowing the associated decompositions to take into account information about the computational costs associated with solving the given CSP instance. Aside from introducing these notions, we obtain efficient theoretical as well as empirical algorithms for computing threshold treewidth and hypertree width and show that these parameters give rise to fixed-parameter algorithms for CSP as well as other, more general problems. We complement our theoretical results with experimental evaluations in terms of heuristics as well as exact methods based on SAT/SMT encodings.

scholarly journals New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set

2014 ◽  
Vol 56 (2) ◽  
pp. 330-346 ◽  
Author(s):  
Bruno Escoffier ◽  
Jérôme Monnot ◽  
Vangelis Th. Paschos ◽  
Mingyu Xiao
Keyword(s):  
Dominating Set ◽  
Edge Dominating Set ◽  
Fixed Parameter
Sign in / Sign up

Export Citation Format

Share Document