Partitioning planar graphs: a fast combinatorial approach for max-cut

Author： Liers F.   Pardella G.  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.51, Iss.1, 2012-01, pp. : 323-344

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

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

Improved approximation of Max-Cut on graphs of bounded degree

By Feige U.   Karpinski M.   Langberg M.  

Journal of Algorithms, Vol. 43, Iss. 2, 2002-05 ,pp. : 201-219

Academic Press

Access to resources Recommend Favorite

Combinatorial and geometric properties of the Max-Cut and Min-Cut problems

By Bondarenko V.   Nikolaev A.  

Doklady Mathematics, Vol. 88, Iss. 2, 2013-09 ,pp. : 516-517

MAIK Nauka/Interperiodica

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

A Semidefinite Programming Based Polyhedral Cut and Price Approach for the Maxcut Problem

By Krishnan Kartik   Mitchell John  

Computational Optimization and Applications, Vol. 33, Iss. 1, 2006-01 ,pp. : 51-71

Springer Publishing Company

Access to resources Recommend Favorite