Výsledky vyhledávání - "fixed-parameter algorithms"
-
1
Fixed-parameter algorithms for graph constraint logic
ISSN: 0304-3975Vydáno: Elsevier B.V 30.05.2023Vydáno v Theoretical computer science (30.05.2023)“…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
Journal Article -
2
Fixed-Parameter Algorithms for Maximum Agreement Forests
ISSN: 0097-5397, 1095-7111Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2013Vydáno v SIAM journal on computing (01.01.2013)“…We present new and improved fixed-parameter algorithms for computing maximum agreement forests of pairs of rooted binary phylogenetic trees…”
Získat plný text
Journal Article -
3
Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
ISSN: 0377-2217, 1872-6860Vydáno: Elsevier B.V 16.10.2018Vydáno v European journal of operational research (16.10.2018)“…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem…”
Získat plný text
Journal Article -
4
Fixed-parameter algorithms for Fair Hitting Set problems
ISSN: 0890-5401Vydáno: Elsevier Inc 01.01.2025Vydáno v Information and computation (01.01.2025)“…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
Journal Article -
5
Fixed-Parameter Algorithms for Unsplittable Flow Cover
ISSN: 1432-4350, 1433-0490Vydáno: New York Springer US 01.02.2023Vydáno v Theory of computing systems (01.02.2023)“… . 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
Journal Article -
6
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 15.08.2017Vydáno v Theoretical computer science (15.08.2017)“…We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time…”
Získat plný text
Journal Article -
7
Fixed-parameter algorithms for scaffold filling
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 01.02.2015Vydáno v Theoretical computer science (01.02.2015)“…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
Journal Article -
8
Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs
ISSN: 0166-218XVydáno: Elsevier B.V 15.10.2025Vydáno v Discrete Applied Mathematics (15.10.2025)“…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
Journal Article -
9
Improved kernelization and fixed-parameter algorithms for bicluster editing
ISSN: 1382-6905, 1573-2886Vydáno: New York Springer US 01.07.2024Vydáno v Journal of combinatorial optimization (01.07.2024)“…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
Journal Article -
10
Fixed-parameter algorithms for vertex cover P3
ISSN: 1572-5286, 1873-636XVydáno: Elsevier B.V 01.02.2016Vydáno v Discrete optimization (01.02.2016)“… 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
Journal Article -
11
Fixed-parameter algorithms for Kemeny rankings
ISSN: 0304-3975, 1879-2294Vydáno: Elsevier B.V 28.10.2009Vydáno v Theoretical computer science (28.10.2009)“…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
Journal Article -
12
Fixed-parameter algorithms for unsplittable flow cover
ISSN: 1432-4350, 1433-0490Vydáno: Springer Verlag 01.03.2020Vydáno v Theory of computing systems (01.03.2020)“… 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…”
Získat plný text
Journal Article -
13
Fixed-Parameter Algorithms for Cluster Vertex Deletion
ISSN: 1432-4350, 1433-0490Vydáno: 01.07.2010Vydáno v Theory of computing systems (01.07.2010)Získat plný text
Journal Article -
14
Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs
ISSN: 1526-1719, 1526-1719Vydáno: 06.11.2024Vydáno v Journal of graph algorithms and applications (06.11.2024)“…In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$,…”
Získat plný text
Journal Article -
15
Fixed-parameter algorithms for DAG Partitioning
ISSN: 0166-218X, 1872-6771Vydáno: Amsterdam Elsevier B.V 31.03.2017Vydáno v Discrete Applied Mathematics (31.03.2017)“…Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. (2009) as DAG Partitioning: given an arc-weighted…”
Získat plný text
Journal Article -
16
Fixed-Parameter Algorithms for Cluster Vertex Deletion
ISSN: 1432-4350, 1433-0490Vydáno: New York Springer-Verlag 01.07.2010Vydáno v Theory of computing systems (01.07.2010)“… 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
Journal Article -
17
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
ISSN: 0022-0000, 1090-2724Vydáno: Elsevier Inc 01.12.2006Vydáno v Journal of computer and system sciences (01.12.2006)“… We extend this to an algorithm enumerating all solutions in O ( d k ⋅ m ) time for a (larger) constant d. As a further result, we present a fixed-parameter algorithm with runtime O…”
Získat plný text
Journal Article -
18
Randomized Fixed-Parameter Algorithms for the Closest String Problem
ISSN: 0178-4617, 1432-0541Vydáno: New York Springer US 01.01.2016Vydáno v Algorithmica (01.01.2016)“… s i . The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms…”
Získat plný text
Journal Article -
19
Fixed-parameter algorithms for the cocoloring problem
ISSN: 0166-218X, 1872-6771Vydáno: Elsevier B.V 20.04.2014Vydáno v Discrete Applied Mathematics (20.04.2014)“…A (k,ℓ)-cocoloring of a graph G is a partition of the vertex set of G into at most k independent sets and at most ℓ cliques. It is known that determining the…”
Získat plný text
Journal Article -
20
Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem
ISSN: 1843-8121, 2248-2695Vydáno: 22.06.2022Vydáno v Scientific annals of computer science (22.06.2022)“…Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new…”
Získat plný text
Journal Article