Výsledky vyhledávání - fixed-parameter algorithm

A fixed-parameter algorithm for the vertex cover P 3 problem Autor Tu, Jianhua

Získat plný text

Fixed-Parameter Algorithms for Cluster Vertex Deletion Autor Hüffner, Falk, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf

“… The parameter is the number of vertex deletions. We present efficient fixed-parameter algorithms for CVD applying the fairly new iterative compression technique…”
Získat plný text

A fixed-parameter algorithm for dominance drawings of DAGs Autor Ortali, Giacomo, Tollis, Ioannis G.

“…A weak dominance drawing Γ of a DAG G=(V,E) is a d-dimensional drawing such that D(u)<D(v) for every dimension D of Γ if there is a directed path from a vertex…”
Získat plný text

An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion Autor Abu-Khzam, Faisal N., Makarem, Norma, Shehab, Maryam

“… A simple fixed-parameter algorithm solves the problem in O⁎(3k), and a decade-old algorithm improved this running to O⁎(2.74k…”
Získat plný text

Fixed-parameter algorithms for graph constraint logic Autor Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira

“…Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL…”
Získat plný text

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees Autor van Iersel, Leo, Janssen, Remie, Jones, Mark, Murakami, Yukihiro, Zeh, Norbert

“…We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations…”
Získat plný text

Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane Autor Cambazard, Hadrien, Catusse, Nicolas

“…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem…”
Získat plný text

Fixed-Parameter Algorithms for Maximum Agreement Forests Autor Whidden, Chris, Beiko, Robert G., Zeh, Norbert

“…We present new and improved fixed-parameter algorithms for computing maximum agreement forests of pairs of rooted binary phylogenetic trees…”
Získat plný text

Fixed-parameter algorithms for Fair Hitting Set problems Autor Inamdar, Tanmay, Kanesh, Lawqueen, Kundu, Madhumita, Purohit, Nidhi, Saurabh, Saket

“…Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic…”
Získat plný text

Fixed-Parameter Algorithms for Unsplittable Flow Cover Autor Cristi, Andrés, Mari, Mathieu, Wiese, Andreas

“… . There is a polynomial time 4-approximation for the problem (Bar-Noy et al. STOC 2001 ) and also a QPTAS (Höhn et al. ICALP 2018 ). In this paper we study fixed-parameter algorithms for the problem…”
Získat plný text

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs Autor Giannopoulou, Archontia C., Mertzios, George B., Niedermeier, Rolf

“…We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time…”
Získat plný text

Fixed-parameter algorithms for scaffold filling Autor Bulteau, Laurent, Carrieri, Anna Paola, Dondi, Riccardo

“…The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods…”
Získat plný text

A fixed-parameter algorithm for the vertex cover P3 problem Autor Tu, Jianhua

“… The VCPt problem is NP-hard for any integer t≥2. In this paper, we restrict our attention to the VCP3 problem and present a fixed-parameter algorithm with runtime O(2kk3.376+n4m…”
Získat plný text

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs Autor Yamada, Suguru, Hanaka, Tesshu

“…For an undirected and edge-weighted graph G=(V,E) and a vertex subset S⊆V, we define a function φG(S)≔(1−α)⋅w(S)+α⋅w(S,V∖S), where α∈[0,1] is a real number,…”
Získat plný text

Improved kernelization and fixed-parameter algorithms for bicluster editing Autor Lafond, Manuel

“… We then propose an algorithm that runs in time O ∗ ( 2 . 581 k ) . Our algorithm has the advantage of being conceptually simple and should be easy to implement…”
Získat plný text

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network Autor Shi, Feng, Li, Hangcheng, Rong, Guozhen, Zhang, Zhen, Wang, Jianxin

“…Phylogenetic trees are unable to represent the evolutionary process for a collection of species if reticulation events happened, and a generalized model named…”
Získat plný text

Fixed-parameter algorithms for vertex cover P3 Autor Chang, Maw-Shang, Chen, Li-Hsuan, Hung, Ling-Ju, Rossmanith, Peter, Su, Ping-Chen

“… set of size at most k in the input graph. In this paper, we give two fixed parameter algorithms to solve the k-Vertex CoverP3 problem…”
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…”
Získat plný text

Fixed-parameter algorithms for Kemeny rankings Autor Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.

“…The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of…”
Získat plný text

A fixed-parameter algorithm for guarding 1.5D terrains Autor Khodakarami, Farnoosh, Didehvar, Farzad, Mohades, Ali

“… In this paper, we turn to fixed-parameter tractability. We present “depth of terrain onion peeling…”
Získat plný text