Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (Q3373669)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time |
scientific article; zbMATH DE number 5012483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time |
scientific article; zbMATH DE number 5012483 |
Statements
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time (English)
0 references
13 March 2006
0 references
random graph
0 references
algorithm
0 references
independent set
0 references
vertex cover
0 references
binomial distributions
0 references
random walks
0 references
0.9315342
0 references
0.89251864
0 references
0.89150953
0 references
0.8898808
0 references
0.88666904
0 references
0 references
0 references
