A fixed-parameter algorithm for the vertex cover P₃ problem
From MaRDI portal
Publication:477591
DOI10.1016/J.IPL.2014.06.018zbMATH Open1305.05223OpenAlexW1987796300MaRDI QIDQ477591FDOQ477591
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.018
Recommendations
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- An FPT algorithm for the vertex cover \(P_4\) problem
- On the vertex cover \(P_3\) problem parameterized by treewidth
- An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth
- A faster FPT algorithm for 3-path vertex cover
Cites Work
- Finding odd cycle transversals.
- Fixed-parameter algorithms for cluster vertex deletion
- A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
- Minimum \(k\)-path vertex cover
- On the vertex \(k\)-path cover
- Title not available (Why is that?)
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Title not available (Why is that?)
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- A generalization of Nemhauser and Trotter's local optimization theorem
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- A linear-time approximation algorithm for the weighted vertex cover problem
- Title not available (Why is that?)
- Node-Deletion Problems on Bipartite Graphs
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
Cited In (34)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
- Approximation algorithms for minimum (weight) connected \(k\)-path vertex cover
- Fixed-parameter algorithms for Vertex Cover \(P_3\)
- Approximating Partially Bounded Degree Deletion on Directed Graphs
- On the vertex cover \(P_3\) problem parameterized by treewidth
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- Computing connected-\(k\)-subgraph cover with connectivity requirement
- Approximation algorithm for minimum connected 3-path vertex cover
- A Parameterized Algorithm for Bounded-Degree Vertex Deletion
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
- The \(k\)-path vertex cover in Cartesian product graphs and complete bipartite graphs
- An efficient local search framework for the minimum weighted vertex cover problem
- A Measure and Conquer Approach for the Parameterized Bounded Degree-One Vertex Deletion
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs
- Faster parameterized algorithm for cluster vertex deletion
- Title not available (Why is that?)
- Faster parameterized algorithms for two vertex deletion problems
- An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
- Generating Faster Algorithms for d-Path Vertex Cover
- PTAS for minimum \(k\)-path vertex cover in ball graph
- Algorithm for online 3-path vertex cover
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs
- Kernels for packing and covering problems
- A faster FPT algorithm for 3-path vertex cover
- A \(5k\)-vertex kernel for 3-path vertex cover
- An \(O^\ast ( 2 . 61 9^k )\) algorithm for \textsc{4-path vertex cover}
- Parameterized algorithm for 3-path vertex cover
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- Title not available (Why is that?)
- Approximating Bounded Degree Deletion via Matroid Matching
This page was built for publication: A fixed-parameter algorithm for the vertex cover \(P_3\) problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477591)
