Author： Ansótegui Carlos
Publisher： Springer Publishing Company
ISSN： 1381-1231
Source： Journal of Heuristics, Vol.17, Iss.5, 2011-10, pp. : 589-614
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 the weakest failure detector for hard agreement problems
By Larrea M.
Journal of Systems Architecture, Vol. 49, Iss. 7, 2003-10 ,pp. :
Access to resources
Recommend
Nature inspired genetic algorithms for hard packing problems
Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. :
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Faster exact solutions for some NP-hard problems
Theoretical Computer Science, Vol. 287, Iss. 2, 2002-09 ,pp. :