On the congruency-constrained matroid base
From MaRDI portal
Cites work
- A combinatorial problem on finite Abelian groups. I
- A generalization of Kneser's addition theorem
- A strongly polynomial algorithm for bimodular integer linear programming
- Advances on strictly \(\varDelta \)-modular IPs
- Comments on bases in dependence structures
- Congruency-constrained TU problems beyond the bimodular case
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations
- Exact arborescences, matchings and cycles
- Exact matching: correct parity and FPT parameterized by independence number
- scientific article; zbMATH DE number 4214018 (Why is no real title available?)
- scientific article; zbMATH DE number 3590289 (Why is no real title available?)
- scientific article; zbMATH DE number 3285137 (Why is no real title available?)
- scientific article; zbMATH DE number 3387622 (Why is no real title available?)
- Matroid enumeration for incidence geometry
- Matroids with nine elements
- Multi-constrained matroidal knapsack problems
- Problems on group-labeled matroid bases
- Random pseudo-polynomial algorithms for exact matroid problems
- Submodular minimization under congruency constraints
- The complexity of restricted spanning tree problems
- The matroidal knapsack: A class of (often) well-solvable problems
This page was built for publication: On the congruency-constrained matroid base
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030554)