Výsledky vyhľadávania - "Fixed-parameter tractable algorithm"

A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks Autor Landry, Kaari, Tremblay-Savard, Olivier, Lafond, Manuel

“…). In this article, we present a fixed-parameter tractable algorithm to solve the problem of finding a maximum agreement cherry…”
Zistit podrobnosti o prístupe

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ískať plný text

A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees Autor Piovesan, Teresa, Kelk, Steven M.

“…Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6 r r!) · poly(n), where n = |X…”
Získať plný text

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ískať 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ískať plný text

An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization Autor Dujmovic, Vida, Whitesides, Sue

Získať 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ískať 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ískať plný text

A fixed-parameter tractable algorithm for combinatorial filter reduction Autor Zhang, Yulin, Shell, Dylan A

“… We give a fixed-parameter tractable algorithm for the general reduction problem by exploiting a transformation into clique covering…”
Získať 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ískať 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ískať 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ískať plný text

A fixed-parameter tractable algorithm for matrix domination Autor Weston, Mark

“…Matrix domination is the NP-complete problem of determining whether a given {0,1} matrix contains a set of k non-zero entries that are in the same row or same…”
Získať plný text

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton Autor Vidya Sagar Sharma

“…Causal DAGs (also known as Bayesian networks) are a popular tool for encoding conditional dependencies between random variables. In a causal DAG, the random…”
Získať plný text

A Fixed-Parameter Tractable Algorithm for the Wavelength Assignment in WDM Mesh Networks Autor Drummond, A.C., da Fonseca, N.L.S., Gyurek, R.

“…The assignment of wavelengths to lightpaths in WDM networks is a crucial problem that needs to be solved efficiently. However, the coloring of the graph…”
Získať plný text

A linear fixed parameter tractable algorithm for connected pathwidth Autor Kanté, Mamadou Moustapha, Christophe, Paul, Thilikos, Dimitrios M

“…The graph parameter of pathwidth can be seen as a measure of the topological resemblance of a graph to a path. A popular definition of pathwidth is given in…”
Získať 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ískať plný text

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

Získať 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ískať 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ískať plný text