Combinatorial Optimization - Algorithms for telecommunications
The following lecture notes contain the material of several courses.
Chapters 1 to 6 correspond to the optional module Combinatorial Optimization of the FirstYear International Master in Computer Science. They arre prerequisite knowledge for the modules Algorithms for telecommunications I and II of the Master of Science in Ubiquitous Networking and Computing (2nd year)
In Algorithms for telecommunications I (first term), Chapters 7 to 10 are presented.
In Algorithms for telecommunications II (second term), some of the Chapters 13 to 19 are exposed.
The lecture notes are continously improving. New chapters will be added as soon as they are available.
Already available chapter are often updated (adding of new material or/and error correction).
- Basic concepts
- Searches in graphs and digraphs
- Complexity of algorithms
- Algorithms in edge-weighted graphs
- Matchings in graphs
- Flows and applications
- Graph colouring
- Linear Programming: Introduction and duality
- Polynomiality of Linear Programming
- Fractional relaxation
- Lagrangian relaxation
Applications to telecommunications
- Design of fault-tolerant on-board networks
- Radio channel assignment and (weighted) colouring
- Compact routing