Meeting 15 Octobre 2016

Jussieu, room 26-25/105, 14:00 until 17:00

No need to bring a computer. Only paper and pen, and if needed some fruits and cookies. Coffee is provided.

We will talk about

We will solve

For a shortest path algorithm follow this decision tree

n = number of vertices, m = number of edges

Subset sum problems

Given positive integers x1,..,xn for a small n.

Given integers x1,..,xn for big n.