Skip to content

On Adaptive Situated Agents

Amir-massoud Farahmand's thoughts on reinforcement learning, machine learning, and other wonderful stuff!

Category: Theoretical Computer Science

Posted on December 3, 2006April 26, 2008

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

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.

Links

  • My academic homepage
  • SoloGen@Twitter

Archives

  • July 2016 (1)
  • June 2008 (2)
  • May 2008 (2)
  • April 2008 (5)
  • March 2008 (3)
  • February 2008 (2)
  • December 2007 (1)
  • November 2007 (1)
  • October 2007 (1)
  • June 2007 (3)
  • January 2007 (3)
  • December 2006 (1)
  • October 2006 (4)
  • September 2006 (2)
  • August 2006 (2)
  • July 2006 (6)
  • June 2006 (2)
  • May 2006 (6)
  • April 2006 (5)
  • March 2006 (1)
  • February 2006 (4)
  • January 2006 (4)
  • December 2005 (10)
  • November 2005 (6)
  • October 2005 (4)
  • September 2005 (6)
  • August 2005 (6)
  • July 2005 (5)
  • June 2005 (6)
  • May 2005 (6)
  • April 2005 (5)
  • March 2005 (9)
  • February 2005 (10)
  • January 2005 (5)
  • December 2004 (13)
  • November 2004 (5)
  • October 2004 (5)
  • September 2004 (6)
  • August 2004 (10)
  • July 2004 (6)
  • June 2004 (8)
  • May 2004 (5)
  • April 2004 (1)
Proudly powered by WordPress