From: markonlinux@... Date: 2008-02-06T14:35:04+09:00 Subject: Re: Computer Science Problems On Feb 6, 4:03 pm, Ken Bloom wrote: > On Wed, 06 Feb 2008 15:27:10 +1100, Clifford Heath wrote: > > markonli...@gmail.com wrote: > >> "This problem actually turns out to be famous in computer science. It's > >> called the Knapsack Problem. > >> My questions are: > >> 1. Is there a definitive book/web site/resource on this and other > >> computer science 'problems'? (Whether Ruby, C, C++, Java, Perl based). > >> 2. Do people have favorite 'Data Structure and Algorithm' books? 3. > >> Other Computer Science book recommendations? I'd love to get to a point > >> where I could look at the quiz description and say "oh.. that looks > >> like the XXX problem" like some of you are able to do. > > > Lots of good suggestions for algorithms books to answer your 2 & 3, but > > note that I think I'm the only one who's attempted to answer your first > > question, and to point you to a list of the "known hard problems", which > > was also the subject of your last paragraph. > > > Does anyone else have better answers to question 1, which seems to be > > Mark's main question? > > I'll post again: > > http://www.nada.kth.se/~viggo/problemlist/is probably as close as you > come to a full compendium of NP-Hard optimization problems, and their > approximation algorithms, etc > > --Ken > > -- > Ken (Chanoch) Bloom. PhD candidate. Linguistic Cognition Laboratory. > Department of Computer Science. Illinois Institute of Technology.http://www.iit.edu/~kbloom1/- Hide quoted text - > > - Show quoted text - Actually, I meant to acknowledge you Ken in my previous reply to Clifford. I found the book excerpt halfway through writing the reply so got sidetracked. Sorry about that ;-) cheers, -- Mark