CSE 6311: ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS

 

 

Class Details

Course:
CSE 6311
Location:
ERB 130
Time:
TuTh 3:30PM - 4:50PM

Instructor Details

Instructor:
Dr. Gautam Das
Office:
ERB 626
Office Phone:
817 272 7595
Email:
gdas [AT) uta [DOT) edu
Office Hours:
TuTh 2:30-3:30 pm
Faculty Profile:
Link

GTA Details

GTA:
Sona Hasani
Office:
ERB 508
Email:
sona DOT hasani [AT) MAVS [dot) UTA [dot) edu
Office Hours:
here [PDF]
About this course
This course aims at exploring advanced computation models, theory and advanced algorithm design and analysis techniques that have broad applicability in solving real-life problems in cross-disciplinary areas. The course will consist of three parts: (a) the theory of NP-completeness, (b) approximation techniques to cope with intractability, and (c) randomized techniques.

Course Logistics
Prerequisites:
CSE 5311 or consent of instructor
Grading:
3 non-cumulative exams worth 1/3 weight each
References:
  • Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, 3rd ed., MIT Press, 2009
  • Michael R. Garey, David S. Johnson: Computers and Intractability: A guide to the theory of NP-completeness, 1979
  • Jon Kleinberg, Eva Tardos: Algorithm Design, 2005
  • Rajeev Motwani, Prabhakar Raghavan: Randomized Algorithms, 1995

Schedule
As the instructor for this course, I reserve the right to adjust this schedule in any way that serves the educational needs of the students enrolled in this course --Gautam Das

Date Day Topic
17-JanTue Course Introduction
19-JanThu Complexity Hierarchy
24-JanTue Polynomial Reductions
26-JanThu NP Complete problems: 3SAT, Clique, Vertex Cover, Max Independent Set
31-JanTue Subset Sum,3 dimensional matching, Exact cover by 3 sets
2-FebThu Graph coloring, Subgraph isomorphism,Steiner tree
7-FebTue Hamiltonian Cycle/Path, Scheduling
9-FebThu TSP, Knapsack, Bin Packing
14-FebTue NP hardness,PSPACE
16-FebThu Review
21-FebTue Exam 1
23-FebTue Exam 1 Discussion
28-FebThu Introduction to Approximation algorithms, Vertex Cover and Maximum Independent Set
2-MarThu Introduction to LP and ILP
7-MarTue ILP Approximation for Vertex Cover
9-MarThu FPTAS for Subset Sum
14-MarTue No Class - Spring Break
16-MarThu No Class - Spring Break
21-MarTue Set cover approximation
23-MarThu Submodular Functions and their optimization
28-MarTue TSP Approximation
30-MarThu Review
4-AprTue Exam 2
6-AprThu Exam 2 Discussion
11-AprTue Introduction to randomized algorithms, Las Vegas/Monte Carlo paradigms, Randomized Quicksort
13-AprThu Randomized Quicksort, Min cut
18-AprTue Max 3 SAT, MAX-SAT, Probabilistic kth largest
20-AprThu Markov/Chebyshev inequalities, Union bound
25-AprTue Chernoff bound and applications, Coupon Collector Problem
27-AprThu Probabilistic classes PP and ZPP, Occupancy problems
2-MayTue Probabilistic Routing
4-MayThu Review
11-MayThu Final Exam, 2-4:30 PM

Announcements
Mar 16, 2017
Practice questions for Exam 2: [PDF]
Feb 9, 2017
Practice questions for Exam 1: [PDF]
Jan 26, 2017:
While emailing the TA please add the words "CSE6311" to the subject. For example, if you are sending an email to set up an appointment, the subject would be "CSE6311: Requesting Appointment". Please follow this convention in order to ensure that your email does not get categorized as spam.
Jan 26, 2017:
This website is the official page for all information to be conveyed to the class. Please keep an eye for any new announcement which is posted here.
Jan 26, 2017:
Please take some time to read the University Policy and Ethics statement.