Pages that link to "Item:Q3499726"
From MaRDI portal
The following pages link to Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms (Q3499726):
Displayed 21 items.
- Parameterized approximation algorithms for packing problems (Q313963) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Improved deterministic algorithms for weighted matching and packing problems (Q534565) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Parameterized algorithms for weighted matching and packing problems (Q955335) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- On counting 3-D matchings of size \(k\) (Q1040648) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
- An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem (Q2430016) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- A dynamic programming algorithm for tree-like weighted set packing problem (Q2638196) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Improved Parameterized Algorithms for Weighted 3-Set Packing (Q3511321) (← links)
- A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)