Deterministic algorithms for matching and packing problems based on representative sets
From MaRDI portal
Recommendations
Cites work
- A faster parameterized algorithm for set packing
- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
- Color-coding
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Fundamentals of parameterized complexity
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- scientific article; zbMATH DE number 6687769 (Why is no real title available?)
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 7053262 (Why is no real title available?)
- Improved deterministic algorithms for weighted matching and packing problems
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Iterative Expansion and Color Coding
- Kernelization of packing problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Multiplying matrices faster than coppersmith-winograd
- Narrow sieves for parameterized paths and packings
- On generalized graphs
- Parameterized coloring problems on chordal graphs
- Parametrized complexity theory.
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Refined memorization for vertex cover
- Representative families: a unified tradeoff-based approach
- Representative sets of product families
- Using nondeterminism to design efficient deterministic algorithms
Cited in
(15)- Representative families for matroid intersections, with applications to location, packing, and covering problems
- A multivariate framework for weighted FPT algorithms
- Randomized parameterized algorithms for the kidney exchange problem
- scientific article; zbMATH DE number 6687769 (Why is no real title available?)
- Parameterized approximation algorithms for packing problems
- Improved Deterministic Algorithms for Weighted Matching and Packing Problems
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Improved deterministic algorithms for weighted matching and packing problems
- The \(k\)-distinct language: parameterized automata constructions
- Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs
- Budgeted matroid maximization: a parameterized viewpoint
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
- Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
- Polynomial-size enumeration kernelizations for long path enumeration
- Representative families: a unified tradeoff-based approach
This page was built for publication: Deterministic algorithms for matching and packing problems based on representative sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195130)
