0-1 Knapsack Problemhttp://www-cse.uta.edu/~holder/courses/cse2320/lectures/l15/node11.htmlhttp://www.brpreiss.com/books/opus5/html/page437.htmlhttp://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Dynamic/knapsackdyn.htmhttp://en.wikipedia.org/wiki/Knapsack_problem
Coin ChangingDynamic Programming Solution to the Coin Changing Problemhttp://perso.wanadoo.fr/colin.barker/lpa/change.htmhttp://sci.vu.edu.au/~amca/SCM2711/ch04_dynprog.pdf
Subset Sumhttp://en.wikipedia.org/wiki/Subset_sum_problemhttp://reptar.uta.edu/NOTES5311/subsetSum4.chttp://www2.cs.science.cmu.ac.th/person/wattana/204451/lesson5.ppthttp://www.student.cs.uwaterloo.ca/~cs341/Old_courses/W04/Notes.php
Minimum Spanning Treeshttp://ww3.algorithmdesign.net/handouts/MST.pdfhttp://www.cs.vu.nl/~kielmann/sccs/mst.pdfhttp://carbon.cudenver.edu/~hgreenbe/glossary/notes/spanningtree.pdfhttp://www.win.tue.nl/~bgerards/math214/notes/3+4-trees.pdfhttp://bit.csc.lsu.edu/~karki/DA-05/DA12.pdfhttp://www.cs.umd.edu/class/sum2005/cmsc451/mst.pdfhttp://www.mpi-sb.mpg.de/~pettie/papers/jacm-optmsf.pdfhttp://www.cs.princeton.edu/courses/archive/fall05/cos226/lectures/mst.pdf