Approximately counting integral flows and cell-bounded contingency tables

DOI10.1145/1060590.1060652zbMATH Open1192.68887DBLPconf/stoc/CryanDR05OpenAlexW1989769501WikidataQ56323921 ScholiaQ56323921MaRDI QIDQ3581402FDOQ3581402

Authors: Mary Cryan, Martin Dyer, Dana Randall 

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060652

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Cited In (4)

• Markov bases and subbases for bounded contingency tables
• On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
• Enumerating Contingency Tables via Random Permanents
• On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries

This page was built for publication: Approximately counting integral flows and cell-bounded contingency tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581402)