35 citations · 194 across the 35 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 19 cited
FPTAS for Counting Monotone CNF
Jingcheng Liu, Pinyan Lu
A monotone CNF formula is a Boolean formula in conjunctive normal form where each variable appears positively. We design a deterministic fully polynomial-time approximation scheme…
cs.DS2013★ 15 cited
A Simple FPTAS for Counting Edge Covers
Chengyu Lin, Jingcheng Liu, Pinyan Lu
An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. Previously, approximation algorithm for counting edge covers is only known fo…