Matching and weighted P₂-packing: algorithms and kernels
From MaRDI portal
Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Matching and \(P _{2}\)-packing: weighted versions
- An improved kernelization for \(P_{2}\)-packing
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- Parameterized algorithms for weighted matching and packing problems
- Parameterized Algorithms for Weighted Matching and Packing Problems
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- scientific article; zbMATH DE number 2119734 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A parameterized perspective on packing paths of length two
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
- An approximation algorithm for maximum triangle packing
- Approximation algorithms for some vehicle routing problems
- Approximation algorithms for the test cover problem
- Faster Algebraic Algorithms for Path and Packing Problems
- Graph-Theoretic Concepts in Computer Science
- Improved Deterministic Algorithms for Weighted Matching and Packing Problems
- Improved parameterized set splitting algorithms: A Probabilistic approach
- Looking at the stars
- Maximum bounded \(H\)-matching is Max SNP-complete
- On the Complexity of General Graph Factor Problems
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- On the completeness of a generalized matching problem
- The P k Partition Problem and Related Problems in Bipartite Graphs
Cited in
(14)- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs
- Parameterized algorithms for weighted matching and packing problems
- Parameterized approximation algorithms for packing problems
- Kernels for packing and covering problems
- Matching and \(P _{2}\)-packing: weighted versions
- On maximum \(P_3\)-packing in claw-free subcubic graphs
- An improved kernelization for \(P_{2}\)-packing
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- Improved kernel results for some FPT problems based on simple observations
- Partition on trees with supply and demand: kernelization and algorithms
- Parameterized and approximation algorithms for finding two disjoint matchings
- Parameterized Algorithms for Weighted Matching and Packing Problems
This page was built for publication: Matching and weighted \(P_2\)-packing: algorithms and kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393902)
