Ganesh Solanke

operation research standard form linear programming algorithms duality simplex algorithm lp model linear programs slack form jarvi's march algorithm computational geometry closest pair of points cross product segment intersect algorithm graham scan algorithm ordering segments any pair of segment intersect convex hull algorithm covex hull problem sweeping direction algorithm line segment geometric algorithms any segment intersect algorithm on segment algorithm graham's theorm vertex cover problem minimum node cover problem maximum clique problem lpt rule graham 0/1 knapsack problem sum of subsets problem 0-1 knapsack problem polynomial time approximation probabilistically good algorithms absolute approximation plannar graph coloring polynnomial time approximation schemes maximum programs stored problem fully polynomial time approximations approximation algorithms scheduling independent tasks maximum independent set problem epsilon approximation mst shell sort graph traversals bubble sort heapsort quick sort searching algorithms minimum spanning tree selection sort sequential search bfs dfs binary search o(nlogn) sorting algorithms merge sort fibonacci search insertion sort quadratic sorting algorithms fundamental computing algorithms graph algorithms divide and conquer np class priori estimates branch and bound np-hard design of algorithms analysis of algorithms worst case p class best case backtracking greedy validation of algorithms upper bound dynamic programming np-complete lower bound asymptotic analysis contradiction for validation algorithms crawling indexing pagerank how google works google search engine working popular search engine search engine