The subspace flatness conjecture and faster integer programming
From MaRDI portal
Cited in
(16)- No polynomial kernels for knapsack
- Space-efficient algorithm for integer programming with few constraints
- A Yannakakis-type theorem for lifts of affine semigroups
- Destroying densest subgraphs is hard
- Parameterized algorithms for block-structured integer programs with large entries
- Parameterized algorithms for multi-label periodic temporal graph realization
- Reducing the Chvátal rank through binarization
- Destroying densest subgraphs is hard
- Protective and nonprotective subset sum games: a parameterized complexity analysis
- From approximate to exact integer programming
- On the size of integer programs with bounded non-vanishing subdeterminants
- On matrices over a polynomial ring with restricted subdeterminants
- Minimizing the weighted number of tardy jobs is W[1]-hard
- Parameterized algorithms on integer sets with small doubling: integer programming, subset sum and k-SUM
- Hardness and fixed parameter tractability for pinwheel scheduling problems
- Minimizing the weighted number of tardy jobs is W[1]-hard
This page was built for publication: The subspace flatness conjecture and faster integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942911)
