A faster FPT algorithm for 3-path vertex cover

DOI10.1016/J.IPL.2015.12.002MaRDI QIDQ903365zbMATHOpenAlexFDO

Authors Ján Katrenič

Publication date 5 January 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2019/10976/

zbMATH Keywords

computational complexityanalysis of algorithmsgraph algorithmsfixed-parameter algorithmbranch and reducedissociation numberpath vertex cover

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Faster FPT algorithm for 5-path vertex cover
• Parameterized algorithm for 3-path vertex cover
• Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem
• Fixed-parameter algorithms for Vertex Cover \(P_3\)
• Approximation algorithm for minimum connected 3-path vertex cover
• Approximation algorithms for minimum weight connected 3-path vertex cover
• An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs

Cites work

• A 2-approximation algorithm for the vertex cover \(P_{4}\) problem in cubic graphs
• A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem
• A measure and conquer approach for the parameterized bounded degree-one vertex deletion
• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
• Finding paths of length \(k\) in \(O^{*}(2^k)\) time
• Minimum \(k\)-path vertex cover
• Mixing Color Coding-Related Techniques
• Node-Deletion Problems on Bipartite Graphs
• On computing the minimum 3-path vertex cover and dissociation number of graphs
• The complexity of dissociation set problems in graphs
• The complexity of restricted spanning tree problems
• The vertex cover \(P_3\) problem in cubic graphs

Cited in

(34)

• The geodesic-transversal problem
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
• Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
• Maximum dissociation sets in subcubic trees
• Approximation algorithms for hitting subgraphs
• Faster parameterized algorithm for cluster vertex deletion
• Kernelization of the 3-path vertex cover problem
• Generating Faster Algorithms for d-Path Vertex Cover
• An improved algorithm for the vertex cover \(P_3\) problem on graphs of bounded treewidth
• An \(O^\ast ( 2 . 61 9^k )\) algorithm for 4-path vertex cover
• Parameterized algorithm for 3-path vertex cover
• Kernels for packing and covering problems
• On the maximum number of maximum dissociation sets in trees with given dissociation number
• Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
• Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
• Faster parameterized algorithms for two vertex deletion problems
• A fixed-parameter algorithm for the vertex cover \(P_3\) problem
• Faster FPT algorithm for 5-path vertex cover
• An FPT algorithm for the vertex cover \(P_4\) problem
• A \(5k\)-vertex kernel for 3-path vertex cover
• The weighted \(k\)-path vertex cover problem on series-parallel graphs
• Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
• Computing connected-\(k\)-subgraph cover with connectivity requirement
• Approximation algorithm for minimum connected 3-path vertex cover
• Algorithm for online 3-path vertex cover
• Approximation algorithms for minimum weight connected 3-path vertex cover
• On the vertex cover \(P_3\) problem parameterized by treewidth
• PTAS for minimum \(k\)-path vertex cover in ball graph
• Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
• A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem
• Partitioning a graph into small pieces with applications to path transversal
• A parameterized algorithm for bounded-degree vertex deletion
• Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
• On the weighted \(k\)-path vertex cover problem

This page was built for publication: A faster FPT algorithm for 3-path vertex cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903365)