Author: Mahajan M. Raman V.
Publisher: Academic Press
ISSN: 0196-6774
Source: Journal of Algorithms, Vol.31, Iss.2, 1999-05, pp. : 335-354
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On Approximation Algorithms for Hierarchical MAX-SAT
Journal of Algorithms, Vol. 26, Iss. 1, 1998-01 ,pp. :
On the max‐cut of sparse random graphs
RANDOM STRUCTURES AND ALGORITHMS, Vol. 52, Iss. 2, 2018-03 ,pp. :
A 2|E|/4-time algorithm for MAX-CUT
Journal of Mathematical Sciences, Vol. 126, Iss. 3, 2005-03 ,pp. :