Approximate counting via random optimization

Random Structures and Algorithms

Volumn 11, Issue 2, 1997, Pages 187-198

  Barvinok, Alexander ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Approximate counting; Average case in optimization; Concentration of measure

Indexed keywords

EID: 0031521740     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199709)11:2<187::AID-RSA6>3.0.CO;2-O     Document Type: Article

References (11)

1. N. Alon, J. H. Spencer, and P. Erdös, The Probabilistic Method, Wiley-Interscience, New York, 1992.
2. Y. Azar, A. Z. Broder, and A. N. Frieze, On the problem of approximating the number of bases of a matroid, Inform. Process. Lett. 50, 9-11 (1994).
3. A. Barvinok, Computing mixed discriminants, mixed volumes and permanents, Discrete Comput. Geom., to appear.
4. A. Barvinok and R. Robb, On the mean radius of permutation polytopes, unpublished.
5. M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, New York, 1993.
6. M. Jerrum and A. Sinclair, The Markov chain Monte Carlo method: an approach to approximate counting and integration, in Approximation Algorithms for NP-hard Problems, D. S. Hochbaum, Ed., PWS Publishing, Boston, 1996, pp. 482-520.
7. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
8. L. Lovász and M. D. Plummer, Matching Theory, Akademiai Kiado, Budapest, 1986.
9. V. D. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Normed Spaces, Lecture Notes in Mathematics, Vol. 1200, Springer-Verlag, Berlin, 1986.
10. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
11. D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.