28 August 2015
Geometric Network Design
This Ph.D. course will cover exact algorithms, approximation algorithms and heuristics for some of the most important variants of the Steiner tree problem, Euclidean Steiner tree and rectilinear Steiner Tree problem. The course will also cover algorithmic methods for the determination of spanners.
Geometric network design is used to solve problems in VLSI circuit design, telecommunications, transportation and distribution networks, computer-aided design, medical imagin, site layout and more. See http://www.diku.dk/GND2015 for more.
Course leader
Pawel Winter
Target group
Ph.D. students and (senior) master students of Computer Science, Operations Research and Mathematics.
Course aim
The objective of the course is to give the participants in-depth understanding of algorithmic methods for some of the most important geometric network design problems such as Steiner networks and spanners.
Fee info
EUR 250: Early bird registration before June 5-th covering registration, handouts, coffee breaks, lunches and a course dinner.
EUR 300: Registration after June 5-th covering registration, handouts, coffee breaks, lunches and a course dinner.