Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
From MaRDI portal
Recommendations
- Approximability of Sparse Integer Programs
- On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility
- On polynomial kernels for sparse integer linear programs
- Algorithms to approximate column-sparse packing problems
- Tight complexity lower bounds for integer linear programming with few constraints
Cites work
- scientific article; zbMATH DE number 66683 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 1254302 (Why is no real title available?)
- scientific article; zbMATH DE number 1380581 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- A Primal Barvinok Algorithm Based on Irrational Decompositions
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A faster algorithm for counting the integer points number in -modular polyhedra
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A polynomial algorithm for minimizing discrete convic functions in fixed dimension
- A reverse Minkowski theorem
- A strongly polynomial algorithm for bimodular integer linear programming
- A tighter relation between hereditary discrepancy and determinant lower bound
- Algebraic and geometric ideas in the theory of discrete optimization
- Anti-blocking polyhedra
- Approximation algorithm for the multicovering problem
- Blocking and anti-blocking pairs of polyhedra
- Centerpoints: a link between optimization and convex geometry
- Combinatorial \(n\)-fold integer programming and applications
- Computing the Continuous Discretely
- Discrepancy of set-systems and matrices
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- Effective lattice point counting in rational convex polytopes
- Elections with few candidates: prices, weights, and covering problems
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Exact algorithms for set multicover and multiset multicover problems
- Improving proximity bounds using sparsity
- Integer conic function minimization based on the comparison oracle
- Integer points in polyhedra
- Integer program with bimodular matrix
- Integer programming in parameterized complexity: five miniatures
- Linear and Integer Programming vs Linear Integration and Counting
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- On Integer Programming and the Branch-Width of the Constraint Matrix
- On -modular integer linear problems in the canonical form and equivalent problems
- On a hypergraph matching problem
- On approximating the covering radius and finding dense lattice subspaces
- On cycles and the stable multi-set polytope
- On largest volume simplices and sub-determinants
- On lattice point counting in -modular polyhedra
- On polynomial kernels for sparse integer linear programs
- On the \(\epsilon\)-perturbation method for avoiding degeneracy
- On the complexity of quasiconvex integer minimization problem
- On the maximal number of columns of a \(\varDelta \)-modular matrix
- On the minors of an incidence matrix and Smith normal form
- On the optimality of pseudo-polynomial algorithms for integer programming
- Points entiers dans les polyèdres convexes
- Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
- Sensitivity theorems in integer linear programming
- Short rational generating functions for lattice point problems
- Six Standard Deviations Suffice
- Solving the knapsack problem via \(\mathbb Z\)-transform
- Solving the stable set problem in terms of the odd cycle packing number
- Stable multi-sets
- The determinant bound for discrepancy is almost tight
- The maximum numbers of faces of a convex polytope
- ``Integer-making theorems
This page was built for publication: Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593834)
