Representative families: a unified tradeoff-based approach
From MaRDI portal
Publication:899582
DOI10.1016/J.JCSS.2015.11.008zbMATH Open1333.68266OpenAlexW2196811896MaRDI QIDQ899582FDOQ899582
Publication date: 30 December 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.11.008
parameterized algorithmrepresentative family\(k\)-internal out-branchinguniform matroid\(k\)-partial cover
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
- Computing small partial coverings
- Representative Sets of Product Families
- Mixing Color Coding-Related Techniques
- Limits and Applications of Group Algebras for Parameterized Problems
- Spanning trees: A survey
- Partial vs. Complete Domination: t-Dominating Set
- Subexponential algorithms for partial cover problems
- On generalized graphs
- Parameterized coloring problems on chordal graphs
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
- A linear vertex kernel for maximum internal spanning tree
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree}
- Sharp separation and applications to exact and parameterized algorithms
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
- Deterministic Parameterized Algorithms for the Graph Motif Problem
- Minimum leaf out-branching and related problems
- A parameterized view on matroid optimization problems
- A survey on algorithms for the maximum internal spanning tree and related problems
- Algorithms for k-Internal Out-Branching
- Spotting Trees with Few Leaves
- A 2k-vertex Kernel for Maximum Internal Spanning Tree
Cited In (14)
- Revisiting the parameterized complexity of maximum-duo preservation string mapping
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space
- Two edge-disjoint paths with length constraints
- On the complexity of finding internally vertex-disjoint long directed paths
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
- Faster deterministic parameterized algorithm for \(k\)-path
- Balanced Judicious Bipartition is Fixed-Parameter Tractable
- Balanced substructures in bicolored graphs
- Long directed \((s,t)\)-path: FPT algorithm
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard)
- Parameterized algorithms for list \(K\)-cycle
- A multivariate framework for weighted FPT algorithms
- Finding Two Edge-Disjoint Paths with Length Constraints
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)
