Relating NP-Complete problems to real world problems

Posted by terru on Stack Overflow See other posts from Stack Overflow or by terru
Published on 2010-03-08T19:37:12Z Indexed on 2010/03/08 19:51 UTC
Read the original article Hit count: 510

Filed under:

I have a decent grasp of NP Complete problems; that's not the issue. What I don't have is a good sense of where they turn up in "real" programming. Some (like knapsack and traveling salesman) are obvious, but others don't seem obviously connected to "real" problems.

I've had the experience several times of struggling with a difficult problem only to realize it is a well known NP Complete problem that has been researched extensively. If I had recognized the connection more quickly I could have saved quite a bit of time researching existing solutions to my specific problem.

Are there any resources (online or print) that specifically connect NP Complete to real world instances?

© Stack Overflow or respective owner

Related posts about online-resources