Approximately counting integral flows and cell-bounded contingency tables

Similar Works

Action	Title	Year	Authors
+	Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes	2007	Alexander Barvinok
+ PDF Chat	Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes	2008	Alexander Barvinok
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2002	Mary Cryan Martin Dyer
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2002	Mary Cryan Martin Dyer
+	An FPTAS for #Knapsack and Related Counting Problems	2011	Parikshit Gopalan Adam R. Klivans Raghu Meka Daniel Štefankovic Santosh Vempala Eric Vigoda
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2003	Mary Cryan Martin Dyer
+	Fully polynomial time approximation schemes (FPTAS) for some counting problems	2016	Tzvi Alon
+	An approximation algorithm for counting contingency tables	2008	Alexander Barvinok Zur Luria Alex Samorodnitsky Alexander Yong
+	Improved Bounds for Sampling Contingency Tables	1999	Ben Morris
+ PDF Chat	On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries	2010	Ivona Bezáková Nayantara Bhatnagar Dana Randall
+ PDF Chat	On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries	2009	Ivona Bezáková Nayantara Bhatnagar Dana Randall
+	Approximate counting by dynamic programming	2003	Martin Dyer
+ PDF Chat	Counting Integer Flows in Networks	2004	W. Baldoni-Silva Jesús A. De Loera Michèle Vergne
+ PDF Chat	Enumerating Contingency Tables via Random Permanents	2007	Alexander Barvinok
+ PDF Chat	A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions	2012	Daniel Štefankovič Santosh Vempala Eric Vigoda
+	Reducing computational effort in detecting integral multicommodity networks	1980	James R. Evans
+	Continuous Covering on Networks: Improved Mixed Integer Programming Formulations	2022	Mercedes Pelegrín Liding Xu
+	Maximum entropy Gaussian approximation for the number of integer points and volumes of polytopes	2009	Alexander Barvinok J. A. Hartigan
+	A faster FPTAS for counting two-rowed contingency tables	2020	Tzvi Alon Nir Halman
+	An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding	2023	Ilan Doron-Arad Ariel Kulik Hadas Shachnai

Works That Cite This (7)

Action	Title	Year	Authors
+ PDF Chat	On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries	2009	Ivona Bezáková Nayantara Bhatnagar Dana Randall
+ PDF Chat	Mathematical Aspects of Mixing Times in Markov Chains	2005	Ravi Montenegro Prasad Tetali
+ PDF Chat	Enumerating Contingency Tables via Random Permanents	2007	Alexander Barvinok
+ PDF Chat	On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries	2010	Ivona Bezáková Nayantara Bhatnagar Dana Randall
+	Counting and sampling problems on Eulerian graphs	2010	Patrick John Creed
+ PDF Chat	Markov bases and subbases for bounded contingency tables	2010	Fabio Rapallo Ruriko Yoshida
+ PDF Chat	Independence Models for Integer Points of Polytopes.	2011	Austin Shapiro

Works Cited by This (26)

Action	Title	Year	Authors
+	Rectangular Arrays with Fixed Margins	1995	Persi Diaconis Anil Gangolli
+	Sampling contingency tables	1997	Martin Dyer Ravi Kannan John Mount
+ PDF Chat	Algebraic algorithms for sampling from conditional distributions	1998	Persi Diaconis Bernd Sturmfels
+	A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries	2001	Mark Jerrum Alistair Sinclair Eric Vigoda
+	Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization	2006	László Lovász Santosh Vempala
+ PDF Chat	A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant	2002	Mary Cryan Martin Dyer
+	Approximate counting by dynamic programming	2003	Martin Dyer
+	The complexity of computing the permanent	1979	Leslie G. Valiant
+	Markov bases and structural zeros	2005	Fabio Rapallo
+	Sampling binary contingency tables with a greedy start	2006	Ivona Bezáková Nayantara Bhatnagar Eric Vigoda