Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory

DOI10.1016/J.JCSS.2016.07.004MaRDI QIDQ314827zbMATH OpenOpenAlexFDO

Authors Shmuel Onn

Publication date 16 September 2016

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.03403

zbMATH Keywords

integer programmingbin packingcutting stockfixed-parameter tractablemulticommodity flowmultiway tabletotally unimodular matrixtotally unimodular monoidinteger Carathéodory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Abstract: The three-way table problem is to decide if there exists an l x m x n table satisfying given line sums, and find a table if there is one. It is NP-complete already for l=3 and every bounded integer program can be isomorphically represented in polynomial time for some m and n as some 3 x m x n table problem. Recently, the problem was shown to be fixed-parameter tractable with parameters l,m. Here we extend this and show that the huge version of the problem, where the variable side n is a huge number encoded in binary, is also fixed-parameter tractable with parameters l,m. We also conclude that the huge multicommodity flow problem with m suppliers and a huge number n of consumers is fixed-parameter tractable parameterized by the numbers of commodities and consumer types. One of our tools is a theorem about unimodular monoids which is of interest on its own right. The monoid problem is to decide if a given integer vector is a finite nonnegative integer combination of a given set of integer vectors, and find such a decomposition if one exists. We consider sets given implicitly by an inequality system. For such sets, it was recently shown that in fixed dimension the problem is solvable in polynomial time with degree which is exponential in the dimension. Here we show that when the inequality system which defines the set is defined by a totally unimodular matrix, the monoid problem can be solved in polynomial time even in variable dimension.

Recommendations

• Huge multiway table problems
• Huge unimodular \(n\)-fold programs
• The Complexity of Three-Way Statistical Tables
• Multiflow Feasibility: An Annotated Tableau
• A fixed-parameter tractability result for multicommodity demand flow in trees

Cites work

• scientific article; zbMATH DE number 3628712 (Why is no real title available?)
• A Linear Programming Approach to the Cutting-Stock Problem
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
• Carathéodory bounds for integer cones
• Fundamentals of parameterized complexity
• Geometric algorithms and combinatorial optimization.
• Huge unimodular \(n\)-fold programs
• Nonlinear discrete optimization. An algorithmic theory
• Polynomiality for bin packing with a constant number of item types
• The Complexity of Three-Way Statistical Tables
• The Graver complexity of integer programming
• Three centuries of categorical data analysis: Log-linear models and maximum likelihood estima\-tion
• \(N\)-fold integer programming
• \(n\)-fold integer programming in cubic time

Cited in

(4)

• Huge multiway table problems
• The support of integer optimal solutions
• High-multiplicity \(N\)-fold IP via configuration LP
• Huge unimodular \(n\)-fold programs

This page was built for publication: Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314827)