Výsledky vyhledávání - "Fixed-parameter tractable algorithm"

FPT implicit enumeration of active schedules Autor 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…”
Získat plný text

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth Autor 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…”
Získat plný text

Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines Autor 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…”
Získat plný text

Discrete multi-module capacitated lot-sizing problems with multiple items Autor 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…”
Získat plný text

Finding Branch-Decompositions and Rank-Decompositions Autor 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…”
Získat plný text

An FPT 2-Approximation for Tree-Cut Decomposition Autor 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…”
Získat plný text

Parameterized algorithms for min-max multiway cut and list digraph homomorphism Autor 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…”
Získat plný text

Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree Autor 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…”
Získat plný text

Imbalance is fixed parameter tractable Autor 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…”
Získat plný text

Parameterized complexity of finding small degree-constrained subgraphs Autor Amini, Omid, Sau, Ignasi, Saurabh, Saket

“…In this article we study the parameterized complexity of problems consisting in finding degree-constrained subgraphs, taking as the parameter the number of…”
Získat plný text

Constrained k -center and movement to independence Autor Dumitrescu, Adrian, Jiang, Minghui

“…We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k…”
Získat plný text

A fixed-parameter-tractable algorithm for set packing Autor Chuanlin, Zhang, Weijia, Jia, Jianer, Chen

Získat plný text

A single exponential-time FPT algorithm for cactus contraction Autor 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…”
Získat plný text

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

Získat plný text

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

“…We study new generalizations of the classic capacitated lot-sizing problem with concave production (or transportation), holding, and subcontracting cost…”
Získat plný text

On Parameterized Independent Feedback Vertex Set Autor 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…”
Získat plný text

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Autor 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…”
Získat plný text

Euclidean TSP in Narrow Strips Autor 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…”
Získat plný text

Infrared: a declarative tree decomposition-powered framework for bioinformatics Autor 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…”
Získat plný text

A single-exponential FPT algorithm for the K4-minor cover problem Autor 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…”
Získat plný text