Author: Cai L. Juedes D. Kanj I.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 553-571
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
Approximation of some NP-hard optimization problems by finite machines, in probability
Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. :
Approximate solution of NP optimization problems
By Ausiello G. Crescenzi P. Protasi M.
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
Faster exact solutions for some NP-hard problems
Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. :