Parameterized Algorithms for Weighted Matching and Packing Problems
From MaRDI portal
Recommendations
- Parameterized algorithms for weighted matching and packing problems
- Improved Deterministic Algorithms for Weighted Matching and Packing Problems
- Matching and \(P _{2}\)-packing: weighted versions
- Improved deterministic algorithms for weighted matching and packing problems
- Matching and weighted \(P_2\)-packing: algorithms and kernels
Cited in
(12)- A dynamic programming algorithm for tree-like weighted set packing problem
- Parameterized and approximation algorithms for finding two disjoint matchings
- Matching and \(P _{2}\)-packing: weighted versions
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Improved Deterministic Algorithms for Weighted Matching and Packing Problems
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Parameterized Weighted Containment
- Improved deterministic algorithms for weighted matching and packing problems
- Algorithms – ESA 2004
- An improved kernelization algorithm for \(r\)-set packing
- Parameterized algorithms for weighted matching and packing problems
- Faster fixed-parameter tractable algorithms for matching and packing problems
This page was built for publication: Parameterized Algorithms for Weighted Matching and Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425482)