Sciweavers

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

9

STOC
2002
ACM

favoriteEmaildiscussreport

84views Algorithms» more STOC 2002»

Random sampling and approximation of MAX-CSP problems

14 years 4 months ago

Random sampling and approximation of MAX-CSP problems

Download www.math.tau.ac.il

Noga Alon, Wenceslas Fernandez de la Vega, Ravi Ka

Real-time Traffic

Algorithms | Random Sampling | STOC 2002 |

claim paper

Related Content

» Solving OverConstrained Problems with SAT Technology

» Polynomial integrality gaps for strong SDP relaxations of Densest ksubgraph

» Approximating connected facility location problems via random facility sampling and core d...

» Connected facility location via random facility sampling and core detouring

» Sampling Subproblems of Heterogeneous Maxcut Problems and Approximation Algorithms

» SublinearTime Approximation for Clustering Via Random Sampling

» Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs

» Approximately uniform random sampling in sensor networks

» Approximating the independent domatic partition problem in random geometric graphs an exp...

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski

Comments (0)