Counting the number of independent sets for a bipartite graph (#BIS) plays a crucial role in the study of approximate counting. It has been conjectured that there is no fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for #BIS, and it was proved that the problem for instances with a maximum degree of 6 is already as hard as the general problem. In this paper, we obtain a surprising tractability result for a family of #BIS instances. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for #BIS when the maximum degree for one side is no larger than 5. There is no restriction for the degrees on the other side, which do not even have to be bounded by a constant. Previously, FPTAS was only known for instances with a maximum degree of 5 for both sides.
@article{arxiv.1412.0073,
title = {FPTAS for #BIS with Degree Bounds on One Side},
author = {Jingcheng Liu and Pinyan Lu},
journal= {arXiv preprint arXiv:1412.0073},
year = {2015}
}
Comments
15 pages, to appear in STOC 2015; Improved presentations from previous version;