Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
From MaRDI portal
Cites work
- \(n\)-fold integer programming in cubic time
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Deciding first order properties of matroids
- Faster Algorithms for Integer Programs with Block Structure
- Finding Branch-Decompositions and Rank-Decompositions
- Finding Branch-Decompositions and Rank-Decompositions
- Finiteness theorems in stochastic integer programming
- First order convergence of matroids
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- scientific article; zbMATH DE number 1962824 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Mathematical Foundations of Computer Science 2003
- Minkowski's Convex Body Theorem and Integer Programming
- On Integer Programming and the Branch-Width of the Constraint Matrix
- On the excluded minors for the matroids of branch-width \(k\)
- On the optimality of pseudo-polynomial algorithms for integer programming
- The complexity landscape of decompositional parameters for ILP
- Voting and bribing in single-exponential time
This page was built for publication: Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842551)
