Approximately counting bases of bicircular matroids
Data Structures and Algorithms
2021-01-27 v4 Combinatorics
Abstract
We give a fully polynomial-time randomised approximation scheme (FPRAS) for the number of bases in a bicircular matroids. This is a natural class of matroids for which counting bases exactly is #P-hard and yet approximate counting can be done efficiently.
Keywords
Cite
@article{arxiv.1808.09548,
title = {Approximately counting bases of bicircular matroids},
author = {Heng Guo and Mark Jerrum},
journal= {arXiv preprint arXiv:1808.09548},
year = {2021}
}
Comments
v3: updated introduction and a slightly better run-time bound. v4: minor revisions; this version is accepted for publication in Combinatorics, Probability and Computing (CPC)