Výsledky vyhledávání - Fixed-parameter algorithms*

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

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 the vertex cover P 3 problem Autor Tu, Jianhua

Získat plný text

Fixed-parameter algorithms in phylogenetics Autor Gramm, Jens, Nickelsen, Arfst, Tantau, Till

“…This chapter surveys the use of fixed-parameter algorithms in phylogenetics. A central computational problem in this field is the construction of a likely phylogeny (genealogical tree…”
Zjistit podrobnosti o přístupu

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

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

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

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

“…Summary The present study investigates the performance of fixed parameter control algorithms on wind‐excited high…”
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

Cutwidth I: A linear time fixed parameter algorithm Autor Thilikos, Dimitrios M., Serna, Maria, Bodlaender, Hans L.

“…The cutwidth of a graph G is the smallest integer k such that the vertices of G can be arranged in a linear layout [ v 1 , … , v n ] in such a way that, for…”
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

“…Given a bipartite graph G , the Bicluster Editing problem asks for the minimum number of edges to insert or delete in G so that every connected component is a…”
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

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

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 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