Simple deterministic approximation algorithms for counting matchings.

Mohsen Bayati David Gamarnik Dimitriy A. Katz Chandra Nair Prasad Tetali

Published in: STOC (2007)

Keyphrases

approximation algorithms
randomized algorithms
np hard
approximation guarantees
special case
worst case
vertex cover
primal dual
facility location problem
minimum cost
network design problem
np hardness
open shop
computational complexity
approximation ratio