On Approximation Algorithms for Hierarchical MAX-SAT

By Agarwal S.   Condon A.  

Journal of Algorithms, Vol. 26, Iss. 1, 1998-01 ,pp. : 141-165

Academic Press

Access to resources Recommend Favorite

Randomized Heuristics for the Max-Cut Problem

By Festa P.   Pardalos P.M.   Resende M.G.C.   Ribeiro C.C.  

Optimization Methods and Software, Vol. 17, Iss. 6, 2002-01 ,pp. : 1033-1058

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the max‐cut of sparse random graphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. : 219-262

John Wiley & Sons Inc

Access to resources Recommend Favorite

A 2^|E|/4-time algorithm for MAX-CUT

By Kulikov A.   Fedin S.  

Journal of Mathematical Sciences, Vol. 126, Iss. 3, 2005-03 ,pp. : 1200-1204

Springer Publishing Company

Access to resources Recommend Favorite

An efficient Lagrangian smoothing heuristic for Max-Cut

By Xia Yong  

Indian Journal of Pure and Applied Mathematics, Vol. 41, Iss. 5, 2010-10 ,pp. : 683-700

Springer Publishing Company

Access to resources Recommend Favorite