Approximate Counting by Dynamic Programming

This proposal describes a project that is going to investigate algorithms for counting knapsack solutions and related sets, with a focus on algorithms that utilise dynamic programming. Both the feasibility of the implementation and the performance characteristics of the algorithms are going to be examined; additional goals pertain to actual algorithmic improvements, with derandomisation being the most ambitious of them.

[1]  Leslie G. Valiant,et al.  Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..

[2]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[3]  Martin E. Dyer,et al.  Sampling contingency tables , 1997 .

[4]  Mark Jerrum,et al.  Mathematical Foundations of the Markov Chain Monte Carlo Method , 1998 .

[5]  Alistair Sinclair,et al.  Random walks on truncated cubes and sampling 0-1 knapsack solutions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[6]  Luca Trevisan.  A Note on Deterministic Approximate Counting for k-DNF , 2002, Electron. Colloquium Comput. Complex..

[7]  Martin E. Dyer,et al.  Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[8]  Thomas P. Hayes,et al.  A non-Markovian coupling for randomly sampling colorings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

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

[10]  Thomas P. Hayes,et al.  Variable length path coupling , 2004, SODA '04.

[11]  Martin E. Dyer,et al.  Randomly coloring constant degree graphs , 2004, Random Struct. Algorithms.