Approximate Counting of Matchings in Sparse Hypergraphs

Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hypergraphs. Our method is based on a generalization of the canonical path method to the case of uniform hypergraphs.

• Type: Journal
• Year: 2012
• Where: CORR
• Authors: Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
• Keywords: Approximation Scheme, CORR 2012, Education, Generalization, Path Method