Author： M. Hitchcock J.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 861-869
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
Approximate solution of NP optimization problems
By Ausiello G. Crescenzi P. Protasi M.
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
Access to resources
Recommend
Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. :
Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics, Vol. 12, Iss. 4-5, 2006-09 ,pp. :
Alignment and Distribution Is Not (Always) NP-Hard
By Boudet V. Rastello F. Robert Y.
Journal of Parallel and Distributed Computing, Vol. 61, Iss. 4, 2001-04 ,pp. :