Author： Raman Venkatesh Saurabh Saket
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.52, Iss.2, 2008-10, pp. : 203-225
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Nature inspired genetic algorithms for hard packing problems
Annals of Operations Research, Vol. 179, Iss. 1, 2010-09 ,pp. :
Access to resources
Recommend
Approximation Algorithms for
By Dean Brian Griffis Adam Parekh Ojas Whitley Adam
Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. :
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics, Vol. 17, Iss. 5, 2011-10 ,pp. :
On the weakest failure detector for hard agreement problems
By Larrea M.
Journal of Systems Architecture, Vol. 49, Iss. 7, 2003-10 ,pp. :