A probabilistic result for the max-cut problem on random graphs
Year of publication: |
2000
|
---|---|
Authors: | Beck, Amir ; Teboulle, Marc |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 27.2000, 5, p. 209-214
|
Saved in:
Saved in favorites
Similar items by person
-
A conditional gradient method with linear rate of convergence for solving convex linear systems
Beck, Amir, (2004)
-
A conditional gradient method with linear rate of convergence for solving convex linear systems
Beck, Amir, (2004)
-
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, Amir, (2003)
- More ...