Suchergebnisse - "Fixed-parameter tractable algorithms"

A single exponential-time FPT algorithm for cactus contraction von Krithika, R., Misra, Pranabendu, Tale, Prafullkumar

“… For a collection F of graphs, the F-Contraction problem takes a graph G and an integer k as input and decides if G can be modified to some graph in F using at …”
Volltext

Infrared: a declarative tree decomposition-powered framework for bioinformatics von Yao, Hua-Ting, Marchand, Bertrand, Berkemer, Sarah J., Ponty, Yann, Will, Sebastian

Volltext

Exact algorithms for multi-module capacitated lot-sizing problem, and its generalizations with two-echelons and piecewise concave production costs von Kulkarni, Kartik, Bansal, Manish

“… We study new generalizations of the classic capacitated lot-sizing problem with concave production (or transportation), holding, and subcontracting cost …”
Volltext

On Parameterized Independent Feedback Vertex Set von Misra, Neeldhara, Philip, Geevarghese, Raman, Venkatesh, Saurabh, Saket

“… We investigate a generalization of the classical Feedback Vertex Set (FVS) problem from the point of view of parameterized algorithms. Independent Feedback …”
Volltext

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number von Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani, Zehavi, Meirav

“… Fradkin and Seymour (J Comb Theory Ser B 110:19–46, 2015) defined the class of digraphs of bounded independence number as a generalization of the class of …”
Volltext

Euclidean TSP in Narrow Strips von Alkema, Henk, de Berg, Mark, van der Hofstad, Remco, Kisfaludi-Bak, Sándor

“… We investigate how the complexity of Euclidean TSP for point sets P inside the strip ( - ∞ , + ∞ ) × [ 0 , δ ] depends on the strip width  δ . We obtain two …”
Volltext

Infrared: a declarative tree decomposition-powered framework for bioinformatics von Yao, Hua-Ting, Marchand, Bertrand, Berkemer, Sarah J., Ponty, Yann, Will, Sebastian

“… Motivation Many bioinformatics problems can be approached as optimization or controlled sampling tasks, and solved exactly and efficiently using Dynamic …”
Volltext

A single-exponential FPT algorithm for the K4-minor cover problem von Kim, Eun Jung, Paul, Christophe, Philip, Geevarghese

“… Given a graph G and a parameter k∈N, the parameterized K4-minor cover problem asks whether at most k vertices can be deleted to turn G into a K4-minor-free …”
Volltext

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs von Alon, Noga, Gutner, Shai

“… There is substantial literature dealing with fixed parameter algorithms for the dominating set problem on various families of graphs. In this paper, we give a …”
Volltext

Maximization coloring problems on graphs with few P4 von Campos, Victor, Linhares-Sales, Cláudia, Sampaio, Rudini, Maia, Ana Karolinna

“… Given a graph G, a greedy coloring of G is a proper coloring such that, for each two colors i<j, every vertex of G colored j has a neighbor colored i. The …”
Volltext

Beyond Max-Cut: λ-extendible properties parameterized above the Poljak–Turzík bound von Mnich, Matthias, Philip, Geevarghese, Saurabh, Saket, Suchý, Ondřej

“… We define strong λ-extendibility as a variant of the notion of λ-extendible properties of graphs (Poljak and Turzík, Discrete Mathematics, 1986). We show that …”
Volltext

FPT implicit enumeration of active schedules von Tarhan, İstenç, Hanen, Claire, Kordon, Alix Munier, Carlier, Jacques, Jouglet, Antoine

“… We consider in this paper the resource constrained scheduling problem with release times and deadlines. We develop an original dynamic programming algorithm …”
Volltext

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth von Baste, Julien, Watel, Dimitri

“… In this paper, we introduce a problem called Minimum subTree problem with Degree Weights, or MTDW. This problem generalized covering tree problems like …”
Volltext

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines von Hanen, Claire, Munier Kordon, Alix

“… Scheduling problems involving a set of dependent tasks with release dates and deadlines on a limited number of resources have been intensively studied …”
Volltext

Discrete multi-module capacitated lot-sizing problems with multiple items von Kulkarni, Kartik, Bansal, Manish

“… We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal …”
Volltext

Finding Branch-Decompositions and Rank-Decompositions von Hliněný, Petr, Oum, Sang-il

“… We present a new algorithm that can output the rank-decomposition of width at most $k$ of a graph if such exists. For that we use an algorithm that, for an …”
Volltext

An FPT 2-Approximation for Tree-Cut Decomposition von Kim, Eun Jung, Oum, Sang-il, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M.

“… The tree-cut width of a graph is a graph parameter defined by Wollan (J Combin Theory, Ser B, 110:47–66, 2015 ) with the help of tree-cut decompositions. In …”
Volltext

Parameterized algorithms for min-max multiway cut and list digraph homomorphism von Kim, Eun Jung, Paul, Christophe, Sau, Ignasi, Thilikos, Dimitrios M.

“… •We design FPT-algorithms for the following two parameterized problems:•List Digraph Homomorphism, which is a “list” version of the classical Digraph …”
Volltext

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree von Madathil, Jayakrishnan, Saurabh, Saket, Zehavi, Meirav

“… Every connected graph on n vertices has a cut of size at least n − 1. We call this bound the spanning tree bound . In the Max-Cut Above Spanning Tree …”
Volltext

Imbalance is fixed parameter tractable von Lokshtanov, Daniel, Misra, Neeldhara, Saurabh, Saket

“… In the Imbalance Minimization problem we are given a graph G=(V,E) and an integer b and asked whether there is an ordering v1…vn of V such that the sum of the …”
Volltext