Vous êtes sur la page 1sur 1

1.job scheduling algo (kleinberg and tordos) 2.greedy algo--knapsack huffman coding sequential loading of pgms in a tape 3.

dynamic pgm- rod cutting matrix chain multiplication travelling salesman job scheduling using dynamic approach longest common subsequence scs(shortest common supersequence) 4.backtracking- n queen set of n integers,find subset that sums to M(horowitz) graph coloring 15 puzzle hamiltonian cycle convex hull tower of hanoi strassens algo for matrix mult sorting r graph er prim,kruskal,djikstra, number of inversions vertex cover,max clique,set cover

Vous aimerez peut-être aussi