Symbiose next seminars

The classical topics in optimization graph theory are extended by several new problems,  inspired by the practice:
- new classes of matching problems in bipartite graphs: inspired by still actual problematic of recognition of protein folding, comparison of protein 3D structure and even the travelling salesman problem,
- shortest walks over the vertices of the unit hypercube: inspired by needs of  optimization module of a warehouse management system, used to schedule the loading operation in a huge warehouse;
- finding the fixed number of connected components with the minimum maximal diameter: inspired by the challenge to determine mathematical electoral districts in a single member constituency ,
- finding the minimum clique cover in a colored graph: inspired by a new approach to the well known classification problem, that is - to recover a partially known stepwise function .