BEGIN:VCALENDAR
BEGIN:VEVENT
SUMMARY:N&O Lecture Matthias Mnich: New Algorithms for Maximum Disjoint Pa
 ths Based on Tree-Likeness
DTSTART:20161130T090000Z
DTEND:20161130T100000Z
UID:88dbda06-5005-4357-a27c-c7b0948118bd
DESCRIPTION:We would like to announce the following lecture from Matthia
 s Mnich (Bonn) at the N&O seminar: Abstract:We study the classical NP-hard
  problems of finding maximum-size subsets from given sets of k terminal pa
 irs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint p
 aths (MaxNDP) in a given graph.\n\nLocation:\nRoom L120\, first floor CWI\
 , Science Park 123 Amsterdam
LOCATION:Room L120\, first floor CWI\, Science Park 123 Amsterdam
END:VEVENT
END:VCALENDAR