Improved deterministic algorithms for weighted matching and packing problems
DOI10.1016/J.TCS.2010.10.042zbMATH Open1215.68109OpenAlexW2107174677MaRDI QIDQ534565FDOQ534565
Songjian Lu, Jianxin Wang, Qilong Feng, Jianer Chen, Yang Liu
Publication date: 18 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.042
Recommendations
- Improved Deterministic Algorithms for Weighted Matching and Packing Problems
- Deterministic algorithms for matching and packing problems based on representative sets
- Parameterized Algorithms for Weighted Matching and Packing Problems
- Parameterized algorithms for weighted matching and packing problems
- Improved Parameterized Algorithms for Weighted 3-Set Packing
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Title not available (Why is that?)
- A faster parameterized algorithm for set packing
- Faster Algebraic Algorithms for Path and Packing Problems
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Title not available (Why is that?)
- An efficient parameterized algorithm for m-set packing
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Title not available (Why is that?)
- Using nondeterminism to design efficient deterministic algorithms
- 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 fixed-parameter tractable algorithms for matching and packing problems
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Cited In (17)
- Parameterized algorithms for weighted matching and packing problems
- Conditional matching preclusion for the arrangement graphs
- The \(k\)-distinct language: parameterized automata constructions
- Parameterized Complexity and Subexponential-Time Computability
- Parameterized approximation algorithms for packing problems
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
- Improved Parameterized Algorithms for Weighted 3-Set Packing
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs
- Parameterized Algorithms for Weighted Matching and Packing Problems
- Faster fixed-parameter tractable algorithms for matching and packing problems
- Improved Deterministic Algorithms for Weighted Matching and Packing Problems
- Mixing Color Coding-Related Techniques
- Using nondeterminism to design efficient deterministic algorithms
- Dealing with several parameterized problems by random methods
- Title not available (Why is that?)
- Improved Algorithms for Several Parameterized Problems Based on Random Methods
This page was built for publication: Improved deterministic 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 Q534565)
