Pages that link to "Item:Q534565"
From MaRDI portal
The following pages link to Improved deterministic algorithms for weighted matching and packing problems (Q534565):
Displaying 10 items.
- An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106) (← links)
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Improved Algorithms for Several Parameterized Problems Based on Random Methods (Q4632170) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
