Article contents
Approximately counting bases of bicircular matroids
Published online by Cambridge University Press: 06 August 2020
Abstract
We give a fully polynomial-time randomized approximation scheme (FPRAS) for the number of bases in 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.
MSC classification
- Type
- Paper
- Information
- Copyright
- © The Author(s), 2020. Published by Cambridge University Press
Footnotes
The work described here was supported by the EPSRC research grant EP/N004221/1 ‘Algorithms that Count’.
References
- 1
- Cited by