Archive for December, 2006

Approximate Algorithms for NP-Hard (Complete) Problems: A Reference

Sunday, December 3rd, 2006

Have you ever wondered if a specific NP-hard problem has an approximation algorithm or not? If yes, you may like to visit this site: A Compendium of NP optimization problems.

Posted in Theoretical Computer Science | 1 Comment »