An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution

Computing high dimensional volumes is a hard problem, even for approximation. Several randomized approximation techniques for #P-hard problems have been developed in the three decades, while some deterministic approximation algorithms are recently developed only for a few #P-hard problems. Motivated by a new technique for a deterministic approximation, this paper is concerned with the volume computation of 0-1 knapsack polytopes, which is known to be #P-hard. This paper presents a new technique based on approximate convolutions for a deterministic approximation of volume computations, and provides a fully polynomial-time approximation scheme for the volume computation of 0-1 knapsack polytopes. We also give an extension of the result to multi-constrained knapsack polytopes with a constant number of constraints.

[1]  Liang Li,et al.  Approximate counting via correlation decay in spin systems , 2012, SODA.

[2]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting list-colorings of a graph , 2007, SODA '07.

[4]  Martin E. Dyer,et al.  On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..

[5]  Liang Li,et al.  Correlation Decay up to Uniqueness in Spin Systems , 2013, SODA.

[6]  Pinyan Lu,et al.  A Simple FPTAS for Counting Edge Covers , 2013, SODA.

[7]  Martin E. Dyer,et al.  Approximate counting by dynamic programming , 2003, STOC '03.

[8]  Dmitriy Katz,et al.  Correlation decay and deterministic FPTAS for counting colorings of a graph , 2012, J. Discrete Algorithms.

[9]  David Gamarnik,et al.  Simple deterministic approximation algorithms for counting matchings , 2007, STOC '07.

[10]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[11]  D. Gamarnik,et al.  Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models , 2008 .

[12]  Eric Vigoda,et al.  An FPTAS for #Knapsack and Related Counting Problems , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[13]  Samarendra Kumar Mitra.  On the Probability Distribution of the Sum of Uniformly Distributed Random Variables , 1971 .

[14]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[15]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[16]  Shuji Kijima,et al.  An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral , 2014, ISAAC.

[17]  Jian Li,et al.  A fully polynomial-time approximation scheme for approximating a sum of random variables , 2013, Oper. Res. Lett..

[18]  Santosh S. Vempala,et al.  Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm , 2015, STOC.

[19]  Santosh S. Vempala,et al.  Simulated annealing in convex bodies and an O*(n4) volume algorithm , 2006, J. Comput. Syst. Sci..

[20]  Parikshit Gopalan,et al.  Polynomial-Time Approximation Schemes for Knapsack and Related Counting Problems using Branching Programs , 2010, Electron. Colloquium Comput. Complex..

[21]  György Elekes,et al.  A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..

[22]  Dror Weitz,et al.  Counting independent sets up to the tree threshold , 2006, STOC '06.

[23]  Eric Vigoda,et al.  A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions , 2010, SIAM J. Comput..