Results 1  10
of
1,879,722
FixedParameter Tractability Results for FullDegree Spanning Tree and Its Dual
 In Proc. the 2nd International Workshop on Parameterized and Exact Computation (IWPEC), Springer LNCS
, 2006
"... We provide firsttime fixedparameter tractability results for the NPhard problems Maximum FullDegree Spanning Tree and MinimumVertex Feedback Edge Set. These problems are dual to each other: In Maximum FullDegree Spanning Tree, the task is to find a spanning tree for a given graph that maximizes ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
We provide firsttime fixedparameter tractability results for the NPhard problems Maximum FullDegree Spanning Tree and MinimumVertex Feedback Edge Set. These problems are dual to each other: In Maximum FullDegree Spanning Tree, the task is to find a spanning tree for a given graph
FixedParameter Tractability Results for Feedback Set Problems in Tournaments
 JOURNAL OF DISCRETE ALGORITHMS
, 2009
"... Complementing recent progress on classical complexity and polynomialtime approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixedparameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable to the nove ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
Complementing recent progress on classical complexity and polynomialtime approximability of feedback set problems in (bipartite) tournaments, we extend and improve fixedparameter tractability results for these problems. We show that Feedback Vertex Set in tournaments (FVST) is amenable
A FixedParameter Tractability Result for Multicommodity Demand Flow in Trees
, 2006
"... We study an NPhard (and MaxSNPhard) problem in trees—Multicommodity Demand Flow—dealing with demand flows between pairs of nodes and trying to maximize the value of the routed flows. This problem has been intensively studied for trees as well as for general graphs mainly from the viewpoint of poly ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of polynomialtime approximation algorithms. By way of contrast, we provide an exact dynamic programming algorithm for this problem that works well whenever some natural problem parameter is small, a reasonable assumption in several applications. More specifically, we prove fixedparameter tractability with respect
FixedParameter Algorithms for Kemeny Scores
"... Abstract. The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus permutation” that is “closest ” to the given set of permutations. Computing an optimal consensus permutat ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
permutation is NPhard. We provide first, encouraging fixedparameter tractability results for computing optimal scores (that is, the overall distance of an optimal consensus permutation). Our fixedparameter algorithms employ the parameters “score of the consensus”, “maximum distance between two input
Fixedparameter tractability and completeness
, 1992
"... For many fixedparameter problems that are trivially solvable in polynomialtime, such as kDominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as kFeedback Vertex Set, exhibit fixedparameter tractability: for eac ..."
Abstract

Cited by 53 (6 self)
 Add to MetaCart
tractable, then so are a variety of parameterized problems, such as Independent Set. Some of the main results of a completeness theory for fixedparameter intractability are surveyed. 1.
A FixedParameter Approach to TwoLayer Planarization
, 2002
"... A bipartite graph is biplanar if the vertices can be placed on two parallel lines (layers) in the plane such that there are no edge crossings when edges are drawn straight. The 2Layer Planarization problem asks if k edges can be deleted from a given graph G so that the remaining graph is biplanar ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
is biplanar. This problem is NPcomplete, as is the 1Layer Planarization problem in which the permutation of the vertices in one layer is fixed. We give the following fixed parameter tractability results: an O(k ·6 k +G) algorithm for 2Layer Planarization and an O(3 k ·G) algorithm for 1Layer
Fixedparameter tractability and logic
 In preparation
, 1999
"... We exhibit a close connection between parameterized complexity theory and logic. Our approach is that of descriptive complexity theory. We study the definability of parameterized problems and try to obtain information about the parameterized complexity of the problems through the syntactical structu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
structure of the defining sentences. On the one hand, we use this approach to prove that certain problems are fixedparameter tractable because they can be defined by syntactically simple formulas. On the other hand, we characterize classes of intractable problems by syntactical means. 1
Approximation and FixedParameter Algorithms for Consecutive Ones Submatrix Problems
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
"... We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomialtime approximation algorithms and fixedparameter tractability results for the NPhard ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomialtime approximation algorithms and fixedparameter tractability results for the NP
Results 1  10
of
1,879,722