A general method to speed up fixed-parameter-tractable algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 125151
- Faster exact algorithms for hard problems: A parameterized point of view
- IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
- scientific article; zbMATH DE number 4205881
- A Fast Algorithm for Trummer’s Problem
- Faster algorithms via approximation theory
- A faster algorithm for solving general LPs
- Faster parameterized algorithms using linear programming
Cites work
- Advice classes of parametrized tractability
- An improved fixed-parameter algorithm for vertex cover
- scientific article; zbMATH DE number 1304341 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- scientific article; zbMATH DE number 1418354 (Why is no real title available?)
- scientific article; zbMATH DE number 1420918 (Why is no real title available?)
Cited in
(50)- Efficiency in exponential time for domination-type problems
- Fixed-parameter algorithms for Kemeny rankings
- Going weighted: parameterized algorithms for cluster editing
- Accelerating optimization by tracing valley
- Call control with \(k\) rejections
- Improving a fixed parameter tractability time bound for the shadow problem
- On the existence of subexponential parameterized algorithms
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- Improved exact algorithms for MAX-SAT
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- A golden ratio parameterized algorithm for cluster editing
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- Optimal-size problem kernels for d-Hitting Set in linear time and space
- Applying modular decomposition to parameterized cluster editing problems
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- On the generalized multiway cut in trees problem
- A cubic-vertex kernel for flip consensus tree
- Pseudo-kernelization: A branch-then-Reduce approach for FPT problems
- A refined search tree technique for dominating set on planar graphs
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- A basic parameterized complexity primer
- New races in parameterized algorithmics
- FAST—Fast Algorithm for the Scenario Technique
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Polynomial kernels for proper interval completion and related problems
- A measure and conquer approach for the parameterized bounded degree-one vertex deletion
- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
- Fixed-parameter algorithms in analysis of heuristics for extracting networks in linear programs
- scientific article; zbMATH DE number 3986532 (Why is no real title available?)
- Polynomial kernels for proper interval completion and related problems
- On making directed graphs transitive
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Fixed-parameter algorithms for DAG partitioning
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- Graph motif problems parameterized by dual
- Why is maximum clique often easy in practice?
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Faster exact algorithms for hard problems: A parameterized point of view
- Vertex cover problem parameterized above and below tight bounds
- Complexity and parameterized algorithms for cograph editing
- Enumerating graphlets with amortized time complexity independent of graph size
- Improved upper bounds for vertex cover
- Refined memorization for vertex cover
- An efficient fixed-parameter algorithm for 3-hitting set
- Fixed parameter algorithms for one-sided crossing minimization revisited
- Two fixed-parameter algorithms for vertex covering by paths on trees
- Fixed-parameter algorithms for cluster vertex deletion
This page was built for publication: A general method to speed up fixed-parameter-tractable algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607033)
