Parameterized approximation algorithms for packing problems
From MaRDI portal
Publication:313963
DOI10.1016/j.tcs.2016.08.004zbMath1355.68294arXiv1505.00709OpenAlexW808328477MaRDI QIDQ313963
Publication date: 12 September 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.00709
Related Items (1)
Cites Work
- Unnamed Item
- Fundamentals of parameterized complexity
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Improved deterministic algorithms for weighted matching and packing problems
- Looking at the stars
- A parameterized perspective on packing paths of length two
- Faster fixed-parameter tractable algorithms for matching and packing problems
- A faster parameterized algorithm for set packing
- Using nondeterminism to design efficient deterministic algorithms
- Narrow sieves for parameterized paths and packings
- Parameterized Approximation via Fidelity Preserving Transformations
- Parameterized Approximation Algorithms for Hitting Set
- Representative Sets of Product Families
- Representative Families: A Unified Tradeoff-Based Approach
- Combining Two Worlds: Parameterised Approximation for Vertex Cover
- Iterative Expansion and Color Coding
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
- Mixing Color Coding-Related Techniques
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Faster Algebraic Algorithms for Path and Packing Problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Color-coding
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
This page was built for publication: Parameterized approximation algorithms for packing problems
