Designation: Required Course
Course Level: Graduate
Prerequisite(s) by Topic:
ICS 553 or Consent of the Instructor
Approximation algorithms to combinatorial problems like scheduling, bin-packing, knapsack, vertex cover, TSP, clique partitioning, graph compression, Steiner
problem on networks. Randomized algorithms: Monte-Carlo, Las-Vegas, and simulated annealing, Genetic algorithms. Graph matching and applications. Network flows and applications.