Výsledky vyhledávání - fixed-parameter tractable algorithms

Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG Autor 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…”
Získat plný text

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems Autor 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…”
Získat plný text

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

“… The goal of this paper is to turn the theoretical tractability results into efficient algorithms and to explore the potential of directed notions of tree-width for defining larger tractable fragments…”
Získat plný text

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…”
Zjistit podrobnosti o přístupu

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

“…This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems…”
Získat plný text

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

Získat plný text

Scaffolding Problems Revisited: Complexity, Approximation and Fixed Parameter Tractable Algorithms, and Some Special Cases Autor 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…”
Získat plný text

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

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

“…This paper studies the application of fixed-parameter tractable (FPT) algorithms to solve computer-aided design (CAD) problems…”
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

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ískat 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.

“… bounded. This paper presents an algorithm for wavelength assignment in transparent WDM networks. Numerical examples illustrate the benefits of the employment of this new theory for the solution of the wavelength assignment problem…”
Získat plný text

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

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

“…A fixed-parameter-tractable algorithm, or FPT algorithm for short, gets an instance (I,k…”
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

The "Art of Trellis Decoding" Is Fixed-Parameter Tractable Autor Jeong, Jisu, Kim, Eun Jung, Oum, Sang-il

“… We present a fixed-parameter tractable algorithm to construct a linear layout of width at most k, if it exists, for input subspaces of a finite-dimensional vector space over F…”
Získat plný text

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

“…Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs…”
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

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

“…: Does there exist a polynomial time exact algorithm for solving the MCLS or MCLS…”
Získat plný text