90 citations · 332 across the 63 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2022
Sampling Approximately Low-Rank Ising Models: MCMC meets Variational Methods
Frederic Koehler, Holden Lee, Andrej Risteski
We consider Ising models on the hypercube with a general interaction matrix , and give a polynomial time sampling algorithm when all but eigenvalues of lie in an inte…
cs.DS2015
On Routing Disjoint Paths in Bounded Treewidth Graphs
Alina Ene, Matthias Mnich, Marcin Pilipczuk +1
We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph and a collection of…