Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

SIAMDM
2011

favoriteEmaildiscussreport

187views Software Engineering» more SIAMDM 2011»

Counting Independent Sets Using the Bethe Approximation

12 years 7 months ago

Counting Independent Sets Using the Bethe Approximation

Download ssg.mit.edu

Venkat Chandrasekaran, Misha Chertkov, David Gamar

Real-time Traffic

Formal Methods | SIAMDM 2011 |

claim paper

Related Content

» What Cannot be Learned with Bethe Approximations

» Approximating minimum independent dominating sets in wireless networks

» Improved Approximations of Independent Sets in BoundedDegree Graphs

» Approximate Scalable Bounded Space Sketch for Large Data NLP

» The Complexity of Approximating BoundedDegree Boolean CSP

» Target Counting under Minimal Sensing Complexity and Approximations

» Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs

» Counting Inversions Offline Orthogonal Range Counting and Related Problems

» Analysis of Approximation Algorithms for kSet Cover Using FactorRevealing Linear Programs

Post Info
More Details (n/a)

Added	17 Sep 2011
Updated	17 Sep 2011
Type	Journal
Year	2011
Where	SIAMDM
Authors	Venkat Chandrasekaran, Misha Chertkov, David Gamarnik, Devavrat Shah, Jinwoo Shin

Comments (0)