Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances (Q5900948)
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: Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances |
scientific article; zbMATH DE number 5712679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances |
scientific article; zbMATH DE number 5712679 |
Statements
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (English)
0 references
26 May 2010
0 references
0.9470201134681702
0 references
0.8550767302513123
0 references
0.8540387749671936
0 references
0.8252214789390564
0 references
0.8232970833778381
0 references
