An improved fixed-parameter algorithm for vertex cover
From MaRDI portal
Recommendations
Cites work
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- Nondeterminism within $P^ * $
- On limited nondeterminism and the complexity of the V-C dimension
Cited in
(63)- On parameterized exponential time complexity
- A general method to speed up fixed-parameter-tractable algorithms
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Parameterized measure \& conquer for problems with no small kernels
- Solving large FPT problems on coarse-grained parallel machines
- On the existence of subexponential parameterized algorithms
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- Improved exact algorithms for MAX-SAT
- A kernel of order 2k-c k for vertex cover
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- The complexity of irredundant sets parameterized by size
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4
- A multivariate framework for weighted FPT algorithms
- A note on the complexity of minimum dominating set
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
- An efficient exact algorithm for constraint bipartite vertex cover
- Deterministic parameterized connected vertex cover
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
- Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
- Efficient algorithms for the max \(k\)-vertex cover problem
- Maximum minimal vertex cover parameterized by vertex cover
- scientific article; zbMATH DE number 6515825 (Why is no real title available?)
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
- A note on vertex cover in graphs with maximum degree 3
- Pareto complexity of two-parameter FPT problems: a case study for partial vertex cover
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- scientific article; zbMATH DE number 1304341 (Why is no real title available?)
- On efficient fixed-parameter algorithms for weighted vertex cover
- scientific article; zbMATH DE number 1979504 (Why is no real title available?)
- scientific article; zbMATH DE number 2080245 (Why is no real title available?)
- scientific article; zbMATH DE number 1508265 (Why is no real title available?)
- Maximum minimal vertex cover parameterized by vertex cover
- Confronting intractability via parameters
- scientific article; zbMATH DE number 1830723 (Why is no real title available?)
- scientific article; zbMATH DE number 861427 (Why is no real title available?)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- scientific article; zbMATH DE number 1420918 (Why is no real title available?)
- Why is maximum clique often easy in practice?
- Rank vertex cover as a natural problem for algebraic compression
- Parameterized and Exact Computation
- A kernel of order \(2k - c\) for Vertex Cover
- Intuitive Algorithms and t-Vertex Cover
- A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
- Graph-Theoretic Concepts in Computer Science
- Improved Parameterized Upper Bounds for Vertex Cover
- A fixed-parameter-tractable algorithm for set packing
- Solving larger maximum clique problems using parallel quantum annealing
- Reachability problems in interval-constrained and cardinality-constrained graphs
- What Is Known About Vertex Cover Kernelization?
- Generating Faster Algorithms for d-Path Vertex Cover
- Addressing bias in algorithmic solutions: exploring vertex cover and feedback vertex set
- Sometimes hoarding is harder than cleaning: NP-hardness of maximum blocked-clause addition
- Improved upper bounds for vertex cover
- Parameterized quantum query algorithms for graph problems
- Component order connectivity admits no polynomial kernel parameterized by the distance to subdivided comb graphs
- Parameterized algorithm for eternal vertex cover
- Refined memorization for vertex cover
- An efficient fixed-parameter algorithm for 3-hitting set
- On the parameterized vertex cover problem for graphs with perfect matching
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
This page was built for publication: An improved fixed-parameter algorithm for vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293227)
