Search Results - fixed-parameter tractable algorithms*

Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG by Raman, Venkatesh, Saurabh, Saket

“…We give improved parameterized algorithms for two “edge” problems MAXCUT and MAXDAG, where the solution sought is a subset of edges. MAXCUT of a graph is a…”
Get full text

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems by Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D. M., Whitesides, S.

“… ). This technique lets us combine Alon, Yuster and Zwick’s color-coding technique with dynamic programming to obtain faster fixed-parameter algorithms for these problems…”
Get full text

Towards fixed-parameter tractable algorithms for abstract argumentation by Dvořák, Wolfgang, Pichler, Reinhard, Woltran, Stefan

“… Most computational problems in this area are intractable but several tractable fragments have been identified…”
Get full text

Fixed-Parameter Tractable Algorithms for Optimal Layout Decomposition and Beyond by Kuang, Jian, Young, Evangeline F. Y.

“…This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems…”
Get full text

A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks by 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…”
Get more information

Fixed parameter tractable algorithms for watchman route related problems on line segment arrangements by Raman, Remi, John J S, Shahin, Subashini, R., Methirumangalath, Subhasree

Get full text

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases by Weller, Mathias, Chateau, Annie, Dallard, Clément, Giroudeau, Rodolphe

“…This paper is devoted to new results about the scaffolding problem, an integral problem of genome inference in bioinformatics. The problem consists in finding…”
Get full text

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

Get full text

A Fixed-Parameter Tractable Algorithm for the Wavelength Assignment in WDM Mesh Networks by 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…”
Get full text

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

“… . We show that Max-Cut-AST admits an algorithm that runs in time O ( 8 k n O ( 1 ) ) , and hence it is fixed parameter tractable with respect to k…”
Get full text

Fixed-parameter tractable algorithms for optimal layout decomposition and beyond by Jian Kuang, Young, Evangeline F. Y.

“…This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems…”
Get full text

A single exponential-time FPT algorithm for cactus contraction by 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…”
Get full text

A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees by 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…”
Get full text

A general method to speed up fixed-parameter-tractable algorithms by Niedermeier, Rolf, Rossmanith, Peter

“…A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k…”
Get full text

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover by Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.

“…Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as…”
Get full text

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

“… with no time windows. This algorithm is proved to be fixed-parameter tractable (FPT in short) parameterized by the maximum number of jobs overlapping following time windows and the maximum processing time…”
Get full text

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems: Parameterized and Exact Algorithms by FELLOWS, M. R, KNAUER, C, NISHIMURA, N, RAGDE, P, ROSAMOND, F, STEGE, U, THILIKOS, D. M, WHITESIDES, S

Get full text

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

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

An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth by 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…”
Get full text

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

“… ⩽ 2 2 , a bound which is best possible. We present an algorithm that is fixed-parameter tractable with respect to  δ…”
Get full text