|
|
Network Design and Applications- Person in charge
- Prof. Dr. Francisco Javier Zaragoza Martínez
- Details
- Vorlesung
- Fields of study
- WPF M-BA ab 5
WPF M-MA ab 1
WPF TM-BA ab 5
WPF TM-MA ab 1
WPF WM-BA ab 5
WPF WM-MA ab 1
WPF CAM-MA-Opti ab 1
- Prerequisites / Organisational information
- The course is directed mainly to graduate students. It is expected that advanced bachelor students may participate.
- Contents
- Many practical problems can be formulated as the problem of choosing in the most economical way some vertices or edges of a graph in order to satisfy some required property. The simplest problems in this area are those of choosing a shortest connecting path or a minimum connected spanning subgraph. These problems are well studied and have very efficient algorithms. However, it is often the case that as soon as we require slightly more interesting properties, the problems become NP-hard. The practical nature of these problems forces us to discover efficient methods to find reasonably good solutions. In this course we are going to present a variety of network design problems together with many applications, we are going to cover the necessary complexity results, and we are going to give polynomial time algorithms for special cases or approximation algorithms for more general cases. We are also going to study fast approximation algorithms for some polynomially solvable problems.
- Additional information
- Verwendung in folgenden UnivIS-Modulen
- Startsemester SS 2019:
- Network Design and Applications (NDA)
- Department: Controlling CAM
Courses
|
|
|