TU Berlin

Combinatorial Optimization & Graph Algorithms group (COGA)Seminar on Algorithmic Discrete Mathematics

COGA 5-Wheel

Page Content

to Navigation

There is no English translation for this web page.

Seminar on Algorithmic Discrete Mathematics

Lecturer: Martin Skutella

In this seminar we will study selected chapters from the book "Combinatorial Optimization - Polyhedra and Efficiency" by Alexander Schrijver.

A short round of presentations (5 minutes per chapter) took place on May 29, 2019.

The more detailed presentation will take place on July 2 and 3, 2019 - see the schedule below.

Schedule of presentations

July 2, 2019 (room MA 517)

10:00 Chapter 13: Path and flow polyhedra and total unimodularity (HF)

11:15 Chapter 14: Partially ordered sets and path coverings (MB)

12:30 Lunch break

13:30 Chapter 15: Connectivity and Gomory-Hu trees (MWo)

14:45 Chapter 20: Bipartite edge-colouring (SH)

16:00 Chapter 21: Bipartite b-matchings and transportation (MWe)

July 3, 2019 (room MA 517)

10:00 Chapter 22: Transversals (SSt)

11:15 Chapter 29: T-joins, undirected shortest paths, and the Chinese postman (CB)

12:30 Lunch break

13:30 Chapter 30: 2-matchings, 2-covers, and 2-factors (AHD)

14:45 Chapter 31: b-matchings (NSc)

16:00 Chapter 28: Edge-colouring (LD)


Quick Access

Schnellnavigation zur Seite über Nummerneingabe