Sciweavers

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

77

Voted

STOC
2007
ACM

favoriteEmaildiscussreport

104views Algorithms» more STOC 2007»

Simple deterministic approximation algorithms for counting matchings

15 years 11 months ago

Simple deterministic approximation algorithms for counting matchings

Download simula.stanford.edu

Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, C

Real-time Traffic

Algorithms | Deterministic Approximation Algorithms | STOC 2007 |

claim paper

Related Content

» A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanent...

» Randomized algorithms for tracking distributed count frequencies and ranks

» Deterministic sampling and range counting in geometric data streams

» Simple deterministic wildcard matching

» Pattern matching in LempelZiv compressed strings fast simple and deterministic

» Approximate Counts and Quantiles over Sliding Windows

» Approximate counting by dynamic programming

» Simple and Efficient Algorithm for Approximate Dictionary Matching

» A simple local 3approximation algorithm for vertex cover

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali

Comments (0)