Representative families for matroid intersections, with applications to location, packing, and covering problems
From MaRDI portal
Publication:2028091
DOI10.1016/j.dam.2021.03.014zbMath1469.90125arXiv1806.11527OpenAlexW3134250307MaRDI QIDQ2028091
René van Bevern, Philipp Zschoche, O. Yu. Tsidulko
Publication date: 31 May 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.11527
Related Items (2)
Constrained hitting set problem with intervals ⋮ A faster parameterized algorithm for temporal matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- A parameterized view on matroid optimization problems
- An 0. 828-approximation algorithm for the uncapacitated facility location problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Facility location problems: a parameterized view
- Fixed-parameter algorithms for maximum-profit facility location under matroid constraints
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Matroid Matching: The Power of Local Search
- Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Deterministic Truncation of Linear Matroids
- Mixing Color Coding-Related Techniques
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Color-coding
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
- Representative Families of Product Families
- Reducibility among Combinatorial Problems
- Location Science
- Facility Location with Matroid or Knapsack Constraints
- Parameterized Algorithms
This page was built for publication: Representative families for matroid intersections, with applications to location, packing, and covering problems
