A parameterized view on matroid optimization problems
From MaRDI portal
(Redirected from Publication:1035682)
Recommendations
- A Parameterized View on Matroid Optimization Problems
- Decomposable multi-parameter matroid optimization problems.
- New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems
- scientific article; zbMATH DE number 4066909
- Representative families for matroid intersections, with applications to location, packing, and covering problems
Cites work
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 139776 (Why is no real title available?)
- scientific article; zbMATH DE number 193022 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 830463 (Why is no real title available?)
- Applications of Menger's graph theorem
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast construction of irreducible polynomials over finite fields
- Finding and counting given length cycles
- Matroid matching and some applications
- Matroid theory and its applications in electric network theory and in statics
- Parameterized coloring problems on chordal graphs
- Parametrized complexity theory.
Cited in
(63)- Parameterized complexity of conflict-free matchings and paths
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. II: Hardness results
- Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
- The matroid intersection cover problem
- Parameterized algorithms for zero extension and metric labelling problems
- Decomposable multi-parameter matroid optimization problems.
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- A multiply constrained matroid optimization problem
- Fixed-parameter tractability of maximum colored path and beyond
- Representative families: a unified tradeoff-based approach
- Fast exact algorithms for survivable network design with uniform requirements
- Fixed-parameter algorithms for fair hitting set problems
- On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Compression via matroids: a randomized polynomial kernel for odd cycle transversal
- The complexity of the matroid-greedoid partition problem
- Forgetfulness can make you faster: an O^*(8.097ᵏ)-time algorithm for weighted 3-set k-packing
- Parameterized counting of trees, forests and matroid bases
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Representative families for matroid intersections, with applications to location, packing, and covering problems
- Deterministic subgraph detection in broadcast CONGEST
- Algorithms for measuring perturbality in matroid optimization
- Parameterized complexity of conflict-free set cover
- Setup optimization problems with matroid structure
- Finding Temporal Paths Under Waiting Time Constraints.
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Stable assignment with couples: parameterized complexity and local search
- Matroid optimization problems with monotone monomials in the objective
- Parameterized applications of symbolic differentiation of (totally) multilinear polynomials
- On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
- Simultaneous feedback edge set: a parameterized perspective
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- A Parameterized View on Matroid Optimization Problems
- Finding even subgraphs even faster
- Cuts in graphs with matroid constraints
- Linear representation of transversal matroids and gammoids parameterized by rank
- Parameterized complexity of geometric covering problems having conflicts
- Diverse collections in matroids and graphs
- Full spark frames
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Determinantal sieving
- Parallel algorithms for matroid intersection and matroid parity
- Polynomial Kernel for Interval Vertex Deletion
- Parameterized complexity of conflict-free matchings and paths
- Stability in graphs with matroid constraints
- Mixing Color Coding-Related Techniques
- Proportionally Fair Matching with Multiple Groups
- Mimicking networks for constrained multicuts in hypergraphs
- On kernelization and approximation for the vector connectivity problem
- Shifted matroid optimization
- Editing to Connected F-Degree Graph
- scientific article; zbMATH DE number 3946155 (Why is no real title available?)
- Computing paths of large rank in planar frameworks deterministically
- A randomized polynomial kernel for subset feedback vertex set
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs. I: Algorithmic results
- Budgeted matroid maximization: a parameterized viewpoint
- Finding temporal paths under waiting time constraints
- Parametric matroid interdiction
- Representative families: a unified tradeoff-based approach
- Complexity of packing common bases in matroids
This page was built for publication: A parameterized view on matroid optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035682)
