activity
20062023
most citedSpatial mixing and approximation algorithms for graphs with bounded connective constant

37 citations · 120 across the 35 of their papers we have counts for

collaborators
Showing 2012Show all

1 paper · 1 filter

cs.DS2012★ 4 cited

Approximate Counting via Correlation Decay on Planar Graphs

Yitong Yin, Chihao Zhang

We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us i…