On integer programming and convolution
From MaRDI portal
Recommendations
- On the optimality of pseudo-polynomial algorithms for integer programming
- scientific article; zbMATH DE number 1405787
- Tight complexity lower bounds for integer linear programming with few constraints
- Efficient algorithms for integer programs with two variables per constraint.
- On Problems Equivalent to (min,+)-Convolution
Cites work
- A near-linear pseudopolynomial time algorithm for subset sum
- Better approximations for tree sparsity in nearly-linear time
- Clustered Integer 3SUM via Additive Combinatorics
- scientific article; zbMATH DE number 3708084 (Why is no real title available?)
- scientific article; zbMATH DE number 6820261 (Why is no real title available?)
- scientific article; zbMATH DE number 6850361 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Integer Programming with a Fixed Number of Variables
- Minkowski's Convex Body Theorem and Integer Programming
- Necklaces, convolutions, and \(X+Y\)
- On Problems Equivalent to (min,+)-Convolution
- On the complexity of integer programming
- On the optimality of pseudo-polynomial algorithms for integer programming
- SETH-based lower bounds for subset sum and bicriteria path
Cited in
(27)- Local linear set on graphs with bounded twin cover number
- On lattice point counting in -modular polyhedra
- Improving the Cook et al. proximity bound given integral valued constraints
- Combinatorial \(n\)-fold integer programming and applications
- A note on a variant of the online open end bin packing problem
- A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
- On the optimality of pseudo-polynomial algorithms for integer programming
- On problems equivalent to \((\min,+)\)-convolution
- On the optimality of pseudo-polynomial algorithms for integer programming
- Tight complexity lower bounds for integer linear programming with few constraints
- The distributions of functions related to parametric integer optimization
- scientific article; zbMATH DE number 7651168 (Why is no real title available?)
- scientific article; zbMATH DE number 7651172 (Why is no real title available?)
- High-multiplicity \(N\)-fold IP via configuration LP
- From approximate to exact integer programming
- Optimizing low dimensional functions over the integers
- A colorful Steinitz lemma with application to block-structured integer programs
- On Integer Programming, Discrepancy, and Convolution
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- An efficient PTAS for stochastic load balancing with Poisson jobs
- A new and faster representation for counting integer points in parametric polyhedra
- Structural parameterizations of b-coloring
- From approximate to exact integer programming
- Knapsack and subset sum with small items
- Does subset sum admit short proofs?
- A simple algorithm for combinatorial n-fold ILPs using the Steinitz lemma
- Designing compact ILPs via fast witness verification
This page was built for publication: On integer programming and convolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090420)
