A Simple FPTAS for Counting Edge Covers
Data Structures and Algorithms
2014-11-04 v2
Abstract
An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. Previously, approximation algorithm for counting edge covers is only known for 3 regular graphs and it is randomized. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of edge covers for any graph. Our main technique is correlation decay, which is a powerful tool to design FPTAS for counting problems. In order to get FPTAS for general graphs without degree bound, we make use of a stronger notion called computationally efficient correlation decay, which is introduced in [Li, Lu, Yin SODA 2012].
Cite
@article{arxiv.1309.6115,
title = {A Simple FPTAS for Counting Edge Covers},
author = {Chengyu Lin and Jingcheng Liu and Pinyan Lu},
journal= {arXiv preprint arXiv:1309.6115},
year = {2014}
}
Comments
To appear in SODA 2014