After successful completion of the course, students are able to...

*********************************************

Students will have a knowledge about some basic algorithms for constructing geometric spanner networks. Some of the presented algorithms are efficient and some of them are not. The major results are in 2D (the plane), but most of them can be generalized to higher dimensional Euclidean space as well as some more general spaces, like metric spaces. Some techniques presented in this course are usable for solving other geometric problems. Some rough ideas of the applications of spanners (in solving other theoretical and practical problems) will be presented.

The lecturer of this course will be Mohammad Farshi / Department of Computer Science, Yazd University.

*********************************************

INFORMATION WILL BE ANNOUNCED AS SOON AS POSSIBLE

*********************************************

The algorithms will be presented during the sessions of the course. There will be some exercises as homework too.

This is a guest professor course of the TU Wien Informatics Doctoral School.

The course is open to all PhD students and interested Master students.

There will be an oral exam at the end of the semester. The exam contains some questions from the book and the presentations, as well as some questions from the excercises.

Please register in TISS.

Giri Narasimhan, Michiel Smid, Geometric Spanner Networks, Cambridge University Press, 2007.