Improved approximation of Max-Cut on graphs of bounded degree

Author： Feige U.   Karpinski M.   Langberg M.  

Publisher： Academic Press

ISSN： 0196-6774

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

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

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

By Liers F.   Pardella G.  

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

Springer Publishing Company

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

Improved Approximation Algorithms for MAX SAT

By Asano T.   Williamson D.P.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 173-202

Elsevier

Access to resources Recommend Favorite

Extremal Problems For Transversals In Graphs With Bounded Degree

By Szabó* Tibor   Tardos† Gábor  

Combinatorica, Vol. 26, Iss. 3, 2006-06 ,pp. : 333-351

Springer Publishing Company

Access to resources Recommend Favorite