782: Advanced Algorithms II --- Spring 2003


Time: MWF 1:00-1:50 PM Braunstein 325

Professor:  Fred Annexstein

Phone:

...(513)-556-1807

FAX:

...(513)-556-7326

Email:

... fred.annexstein@uc.edu

Address:

... 889 Rhodes Hall

 

... Department of ECECS

 

... College of Engineering

 

... University of Cincinnati

 

... Cincinnati, Ohio 45221

 

... My Public PGP Key

 

News:

 

No Class May 21, 2003 –

 

Final Project Presentations to begin week of May 26. Please contact me to schedule your presentation.

 

Web:

Information on this course will be posted on the course web page and will be regularly updated. You should regularly look at this web page for announcements, updated syllabus, homework assignments, etc. The course web page address is: http://www.ececs.uc.edu/~annexste/Courses/782-2003

Description:

Covers classical and current topics in sequential, parallel and distributed algorithms, including NP-completeness, Graph and Network Algorithms, Routing and Flow Algorithms, Internet and Web Algorithms, Information Organization and Retrieval, Approximation Algorithms and Probabilistic algorithms. 

Textbook and Notes:

Design and Analysis of Sequential and Parallel Algorithms, Berman and Paul

            Handouts, papers and downloads from Internet  

Prerequisites: Advanced Algorithms I

Homework: 3-4 assignments

 

   Assignment #1: Due Monday, April 21

   Assignment #2: Due Wednesday, May 7

 

Midterm Exam is Wednesday, May 7 in class

 

Study Guides: Midterm Topic Review  Midterm Study Questions

 

Final Project: 

Proposals due May 16 in class

 

See Details on Final Project Requirements

 

Tests:  One Midterm Exam

Grading (tentative): Homework 33%, Final Project 33%, Midterm Test 34%.

Approximate Schedule of Topics:

 

  1. NP-completeness  and Approximation algorithms (Chapter 20)

1.1   Concept of NP and NP-completeness

                   Lectures Week 1

1.2   Examples of NP-complete Problems, e.g., Satisfiability, 3-SAT, Clique, Vertex Cover, Maximum Independent Set, TSP, Hamiltonian Cycle

                   Lectures Week 2 and Continued

.

1.3   Clustering, Dominating Set, K-Center Problems, Generalized Bottleneck Problems,  Facility and Server Locations Problems

Lectures Week 3

 

  1. Graph and Network Algorithms (Chapter 19)

2.1   Biconnected Components

2.2  Powers of Graphs and Hamiltonian cycles

2.3  Steiner Trees, Multicasting, and Center-based trees

 

 Lectures Week 4

 

  1. Text Processing and Pattern matching
    1. Naïve Algorithm
    2. Karp-Rabin Algorithm
    3. Boyer-Moore methods
    4. Knuth-Morris-Pratt Algorithm

 

Lectures Week 5

 

 

      4.  Indexing and Searching Methods

            Suffix-arrays and suffix-tries

            Word-based indexing

            Inverted files, bitmaps, and signature files

 

Lectures Week 6 and 7

 

5.  Searching and Information Content

Vector space models

Similarity Measures

Latent Semantic Indexing

SVD and Principal Component Analysis

Social Network Analysis

 

Notes:  http://www-2.cs.cmu.edu/afs/cs/project/pscico-guyb/realworld/www/indexing.html

 

 

6.  Internet and Web Algorithms

1   Search and retrieval of relevant web resources

2   PageRank and HITS

3   Web Crawling

4   Web Caching and DHTs

 

 

  1. Student presentations on web applications.

Archive of Final Projects