Search Results - fixed-parameter algorithms~

Fixed-Parameter Algorithms for Cluster Vertex Deletion by 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…”
Get full text

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

Get full text

Fixed-parameter algorithms for graph constraint logic by 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…”
Get full text

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

“…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem…”
Get full text

Fixed-Parameter Algorithms for Maximum Agreement Forests by 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…”
Get full text

Fixed-parameter algorithms for Fair Hitting Set problems by 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…”
Get full text

Fixed-Parameter Algorithms for Unsplittable Flow Cover by 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…”
Get full text

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

Get full text

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs by 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…”
Get full text

A fixed-parameter algorithm for dominance drawings of DAGs by 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…”
Get full text

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs by 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,…”
Get full text

An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion by 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…”
Get full text

Improved kernelization and fixed-parameter algorithms for bicluster editing by 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…”
Get full text

Fixed-parameter algorithms for vertex cover P3 by 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…”
Get full text

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…”
Get full text

Fixed-parameter algorithms for scaffold filling by 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…”
Get full text

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees by 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…”
Get full text

Fixed-parameter algorithms for Kemeny rankings by 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…”
Get full text

Fixed-parameter algorithms for unsplittable flow cover by Cristi, Andrés, Mari, Mathieu, Wiese, Andreas

“… There is a polynomial time 4-approximation for the problem [Bar-Noy et al., STOC 2000] and also a QPTAS [Höhn et al., ICALP 2014]. In this paper we study fixed-parameter algorithms for the problem…”
Get full text

Performance of fixed-parameter control algorithms on high-rise structures equipped with semi-active tuned mass dampers by Demetriou, Demetris, Nikitas, Nikolaos, Tsavdaridis, Konstantinos Daniel

“…Summary The present study investigates the performance of fixed parameter control algorithms on wind‐excited high…”
Get full text