A Randomized Approximation Scheme for Metric MAX-CUT

Author： Fernandez de la Vega W. Kenyon C.

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.63, Iss.4, 2001-12, pp. : 531-541

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Path Relinking Scheme for the Max-Cut Problem within Global Equilibrium Search

International Journal of Swarm Intelligence Research (IJSIR), Vol. 2, Iss. 2, 2011-04 ,pp. : 42-51

IGI Global_journal

Access to resources Recommend Favorite

Lagrangian Smoothing Heuristics for Max-Cut

By Alperin Hernán Nowak Ivo

Journal of Heuristics, Vol. 11, Iss. 5-6, 2005-12 ,pp. : 447-463

Springer Publishing Company

Access to resources Recommend Favorite

On greedy construction heuristics for the MAX-CUT problem

By Kahruman Sera Kolotoglu Elif Butenko Sergiy Hicks Illya V.

International Journal of Computational Science and Engineering, Vol. 3, Iss. 3, 2008-04 ,pp. : 211-218

Inderscience Publishers

Access to resources Recommend Favorite

Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut

By Homer S. Peinado M.

Journal of Parallel and Distributed Computing, Vol. 46, Iss. 1, 1997-10 ,pp. : 48-61

Academic Press

Access to resources Recommend Favorite

On max cut in cubic graphs

By Calamoneri Tiziana

Parallel Algorithms and Applications, Vol. 17, Iss. 3, 2001-01 ,pp. : 165-183

Taylor & Francis Ltd

Access to resources Recommend Favorite