|
Lecturer:
Prof. Dr. Angelika Steger
|
|
|
Area:
4 lectures per week in
area III (Theoretical Computer Science)
advanced course
, topic algorithms
|
|
|
Time and Place:
Tue 10h s.t. - 12:00, lecture hall 1260
Thu 11h s.t. - 12:45, lecture hall 2770
|
|
|
Exercises:
2 hours per week exercises accompanying the lectures
Time and place to be announced.
Teaching Assistant: Thomas Schickinger
Course Certificate: To get a course certificate students must
get at least 40% on the homework assignments and
pass the final exam.
|
|
|
Audience:
graduate students of computer science
students with computer science as minor
|
|
|
Prerequisites:
1st and 2nd year courses
Course Efficient Algorithms and Datastructures I advantagious, but not necessary.
|
|
|
Recommended for:
In-depth knowledge in topic Algorithms
|
|
|
Contents:
- Graph Matching
- Network Flow
- Linear Programming
- Integer Programming
- Polynomial-Time Approximation Algorithms
- Lower Bound
|
|
|
Related and Advanced Lectures:
|
|
|
Lecture Notes:
Not available.
|
|
|
References:
-
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
-
The design and analysis of computer algorithms
Addison-Wesley Publishing Company, Reading, MA, 1976
-
Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin:
-
Network Flows: Theory, Algorithms, and Applications
Prentice Hall, Englewood Cliffs, NJ, 1993
-
Robert Endre Tarjan:
-
Data Structures and Network Algorithms
CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Philadelphia, PA, 1983
-
Kurt Mehlhorn:
-
Data structures and algorithms 2 : Graph algorithms and NP-Completeness
EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin - Heidelberg - New York - London - Paris - Tokyo - Hong Kong, 1984
-
Christos H. Papadimitriou, Kenneth Steiglitz:
-
Combinatorial optimization : Algorithms and complexity
Prentice-Hall, Englewood Cliffs, NJ, 1982
|
|
|
Office Hours:
look here
|
|
