F07 NetCmpx Sem01

From InterSciWiki

1st week's seminar devoted to how engineering, computing, and social science approaches to problems often assume that easier algorithms provide better solutions.

We spent 2 hours on how hard to computing routing and cohesion algorithms deriving from Menger's 1927 theorem provide solutions to hard problems. Proofs, examples, applications.