Representative families: a unified tradeoff-based approach
From MaRDI portal
(Redirected from Publication:899582)
Recommendations
- Representative families: a unified tradeoff-based approach
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- A parameterized view on matroid optimization problems
Cites work
- A 2k-vertex kernel for maximum internal spanning tree
- A linear vertex kernel for maximum internal spanning tree
- A parameterized view on matroid optimization problems
- A survey on algorithms for the maximum internal spanning tree and related problems
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- Algorithms for k-internal out-branching
- Computing small partial coverings
- Deterministic algorithms for matching and packing problems based on representative sets
- Deterministic parameterized algorithms for the graph motif problem
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Limits and Applications of Group Algebras for Parameterized Problems
- Minimum leaf out-branching and related problems
- Mixing Color Coding-Related Techniques
- On generalized graphs
- Parameterized coloring problems on chordal graphs
- Partial vs. Complete Domination: t-Dominating Set
- Reducing to independent set structure -- the case of k-internal spanning tree
- Representative sets of product families
- Sharp separation and applications to exact and parameterized algorithms
- Spanning trees: A survey
- Spotting trees with few leaves
- Subexponential algorithms for partial cover problems
Cited in
(23)- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Long directed \((s,t)\)-path: FPT algorithm
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Revisiting the parameterized complexity of maximum-duo preservation string mapping
- Faster deterministic parameterized algorithm for k-path
- Two edge-disjoint paths with length constraints
- A multivariate framework for weighted FPT algorithms
- Representative sets of product families
- Representative families: a unified tradeoff-based approach
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Finding two edge-disjoint paths with length constraints
- Representative families of product families
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Balanced judicious bipartition is fixed-parameter tractable
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Efficient computation of representative sets with applications in parameterized and exact algorithms
- Balanced substructures in bicolored graphs
- Parameterized algorithms for list \(K\)-cycle
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
- Balanced substructures in bicolored graphs
- Anti-factor is FPT parameterized by treewidth and list size (but counting is hard)
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
This page was built for publication: Representative families: a unified tradeoff-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899582)
