Randomized parameterized algorithms for P₂-packing and co-path packing problems
From MaRDI portal
Randomized parameterized algorithms for \(P 2\)-packing and co-path packing problems
Recommendations
Cites work
- A linear kernel for co-path/cycle packing
- A parameterized perspective on packing paths of length two
- An approximation algorithm for maximum triangle packing
- Approximating Node-Deletion Problems for Matroidal Properties
- Approximation algorithms for the test cover problem
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- Graph-Theoretic Concepts in Computer Science
- Improved algorithms for path, matching, and packing problems
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Looking at the stars
- Matching and \(P _{2}\)-packing: weighted versions
Cited in
(28)- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing}
- An improved deterministic parameterized algorithm for cactus vertex deletion
- Kernels for packing and covering problems
- Narrow sieves for parameterized paths and packings
- Randomized parameterized algorithms for the kidney exchange problem
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- Dealing with several parameterized problems by random methods
- A parameterized algorithm for bounded-degree vertex deletion
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Randomized parameterized algorithms for co-path set problem
- Kernelization and randomized parameterized algorithms for co-path set problem
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Improved algorithms for several parameterized problems based on random methods
- Random methods for parameterized problems
- Partition on trees with supply and demand: kernelization and algorithms
- Improved kernel results for some FPT problems based on simple observations
- Approximating partially bounded degree deletion on directed graphs
- Approximating bounded degree deletion via matroid matching
- A Parameterized Perspective on Packing Paths of Length Two
- Approximating power node-deletion problems
- Approximating power node-deletion problems
- Solving Co-Path/Cycle Packing and Co-Path Packing faster than \(3^k\)
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
- Solving Co-Path/Cycle Packing and Co-Path Packing faster than \(3^k\)
- A parameterized perspective on packing paths of length two
This page was built for publication: Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354298)
