An FPTAS for #knapsack and related counting problems

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 817-826

  Gopalan, Parikshit ^a   Klivans, Adam ^b   Meka, Raghu ^b   Štefankovič, Daniel ^c   Vempala, Santosh ^d   Vigoda, Eric ^d  

^a MICROSOFT RESEARCH   (United States)

^b University of Texas at Austin   (United States)

^c University of Rochester   (United States)

^d Georgia Institute of Technology   (United States)

Author keywords

Approximate Counting; Contingency Tables; Derandomization; FPRAS; Knapsack; Multidimensional Knapsack

Indexed keywords

APPROXIMATE COUNTING; CONTINGENCY TABLE; DERANDOMIZATION; FPRAS; KNAPSACK; MULTIDIMENSIONAL KNAPSACK;

COMPUTER SCIENCE; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; MONTE CARLO METHODS;

COMBINATORIAL OPTIMIZATION;

EID: 84861647154     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.32     Document Type: Conference Paper

References (25)

1. M. Agrawal, N. Kayal, and N. Saxena. PRIMES is in P. Ann. of Math., 160(2):781-793, 2004. (Pubitemid 40447851)
2. M. Ajtai and A. Wigderson. Deterministic simulation of probabilistic constant depth circuits. Advances in Computing Research - Randomness and Computation, 5:199-223, 1989. A preliminary version appears in Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS), 11-19, 1985.
3. S. Arora and B. Barak. Computational complexity: A Modern Approach. Cambridge University Press, Cambridge, 2009.
4. M. Bayati, D. Gamarnik, D. Katz, C. Nair, and P. Tetali. Simple deterministic approximation algorithms for counting matchings. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 122-127, 2007.
5. I. Diakonikolas, P. Gopalan, R. Jaiswal, R. A. Servedio, and E. Viola. Bounded independence fools halfspaces. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 171-180, 2009.
6. M. Dyer. Approximate counting by dynamic programming. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 693-699, 2003.
7. M. Dyer, A. Frieze, and R. Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. J. ACM, 38(1):1-17, 1991.
8. M. Dyer, A. Frieze, R. Kannan, A. Kapoor, L. Perkovic, and U. Vazirani. A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem. Combin. Probab. Comput., 2(3):271-284, 1993.
9. D. Gamarnik and D. Katz. Correlation decay and deterministic FPTAS for counting list-colorings of a graph. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1245-1254, 2007.
10. M. Jerrum. A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Random Struct. Algorithms, 7(2):157-165, 1995.
11. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. Comput., 18(6):1149-1178, 1989. (Pubitemid 20613573)
12. M. Jerrum and A. Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput., 22(5):1087-1116, 1993.
13. M. Jerrum and A. Sinclair. The Markov Chain Monte Carlo Method: An Approach To Approximate Counting and Integration. In D. S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, pages 482-520. PWS Publishing, 1996.
14. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM, 51(4):671-697, 2004.
15. J. Kamp, A. Rao, S. P. Vadhan, and D. Zuckerman. Deterministic extractors for small-space sources. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pages 691-700, 2006.
16. R. M. Karp and M. Luby. Monte Carlo algorithms for the planar multiterminal network reliability problem. J. Complexity, 1(1):45-64, 1985.
17. 4) volume algorithm. J. Comput. System Sci., 72(2):392-417, 2006.
18. M. Luby, D. Randall, and A. Sinclair. Markov chain algorithms for planar lattice structures. SIAM J. Comput., 31(1):167-192, 2001. (Pubitemid 33779784)
19. M. Luby and B. Veličković. On deterministic approximation of DNF. Algorithmica, 16(4/5):415-433, 1996. (Pubitemid 126416935)
20. R. Meka and D. Zuckerman. Pseudorandom generators for polynomial threshold functions. In Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 427-436, 2010.
21. B. Morris and A. Sinclair. Random walks on truncated cubes and sampling 0-1 knapsack solutions. SIAM J. Comput., 34(1):195-226, 2004. (Pubitemid 40449921)
22. Y. Rabani and A. Shpilka. Explicit construction of a small epsilon-net for linear threshold functions. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC), pages 649-658, 2009.
23. A. Sly. Computational transition at the uniqueness threshold. In Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 287-296, 2010.
24. D. Štefankovič, S. Vempala, and E. Vigoda. Adaptive simulated annealing: a near-optimal connection between sampling and counting. J. ACM, 56(3):1-36, 2009.
25. D. Weitz. Counting independent sets up to the tree threshold. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), pages 140-149, 2006.