Near-linear time algorithm for n-fold ILPs via color coding
From MaRDI portal
Publication:5091234
Recommendations
Cites work
- \(N\)-fold integer programming
- \(N\)-fold integer programming and nonlinear multi-transshipment
- A linear-time approximation algorithm for weighted matchings in graphs
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
- An integer analogue of Carathéodory's theorem
- Approximating edit distance in near-linear time
- Color-coding
- Combinatorial \(n\)-fold integer programming and applications
- Empowering the configuration-IP -- new PTAS results for scheduling with setups times
- Evaluating and tuning n-fold integer programming
- Faster Algorithms for Integer Programs with Block Structure
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 6850361 (Why is no real title available?)
- Huge unimodular \(n\)-fold programs
- Storing a Sparse Table with 0 (1) Worst Case Access Time
Cited in
(2)
This page was built for publication: Near-linear time algorithm for \(n\)-fold ILPs via color coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091234)