Discrete Mathematics II
Winter 2012/13.

Instructor.

  • Tibor Szabó
  • Phone: 838-75217
  • Office: 211, Arnimallee 3
  • Email: szabo at math dot fu-berlin dot de
    • Top of page

    Time.

  • Lectures: Tuesdays, 8:30 - 10:00 Uhr - Arnimallee 6 SR 032 and Wednesdays, 8:30 - 10:00, Arnimalle 6 SR 032.
  • Exercises: Tuesdays, 12:30 - 14:00 - Arnimallee 6 SR 032.
    • Top of page

    Topics of the course.

  • Graph Algorithms (matchings, network flows)
  • Linear Programming
  • Simplex Algorithms
  • Duality
  • Applications in Combinatorics and Algorithms
  • Ellipsoid and Interior Point Methods
  • Randomized Simplex Algorithms in Abstract Models
    Top of page

    Prerequisites.

  • basic graph theory, combinatorics, linear algebra, calculus. Here is the list of material covered in Discrete Math I.
    Top of page

    Requirements.

    Here you can read the requirements and formalities of the course.
    Top of page

    Final.

  • Final exam: February 20th (Wednesday), 9:30 - 12:30, Room: HS 001, Arnimallee 3.
  • Make-up final exam: March 20th (Wednesday), 9:30 - 12:30 Room: HS 001, Arnimallee 3..
    Top of page

    Exercises.

    You find the exercises and the dynamic list of material here.

    Literature.

  • J. Matousek - B. Gaertner Understanding and Using Linear Programming
  • D. West, Introduction to Graph Theory
  • L. Lovász, J. Pelikán, K. Vesztergombi, Discrete Mathematics

    Further reading:
  • V. Chvátal, Linear Programming.
  • A. Schrijver, Theory of Linear and Integer Programming
  • A. Schrijver, Combinatorial Optimization