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

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

“…Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several…”
Získat plný text

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. Specifically, we focus on…”
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 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. Specifically, we focus on…”
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.

“…We obtain faster algorithms for problems such as r -dimensional matching and r -set packing when the size k of the solution is considered a parameter. We first…”
Získat plný text

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. MAXCUT of a graph is a…”
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 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

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. We seek algorithms whose complexity can be expressed as…”
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

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

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

Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions Autor Mahankali, Arvind V, Woodruff, David P, Zhang, Ziyu

“…We study low rank approximation of tensors, focusing on the tensor train and Tucker decompositions, as well as approximations with tree tensor networks and…”
Získat plný text

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

“… . For graphs which are K h -minor-free, the running time is further reduced to ( O (log  h )) hk /2 n . Fixed-parameter tractable algorithms that are linear in the number of vertices of the graph were previously known only for planar…”
Získat plný text