scientific article; zbMATH DE number 7561568

DOI10.4230/LIPIcs.ICALP.2019.75MaRDI QIDQ5091234

Lars Rohwedder, Alexandra Lassota, Klaus Jansen

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

color coding\(n\)-fold ILPnear-linear time algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

About the Complexity of Two-Stage Stochastic IPs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(N\)-fold integer programming and nonlinear multi-transshipment
• \(N\)-fold integer programming
• An integer analogue of Carathéodory's theorem
• A linear-time approximation algorithm for weighted matchings in graphs
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Huge Unimodular $n$-Fold Programs
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Color-coding
• Approximating Edit Distance in Near-Linear Time
• Faster Algorithms for Integer Programs with Block Structure
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations

This page was built for publication: