BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Algebraic Routing (Part 2) - Tim Griffin
DTSTART:20061115T100000Z
DTEND:20061115T120000Z
UID:TALK5453@talks.cam.ac.uk
CONTACT:Sam Staton
DESCRIPTION:It has been known for several decades that shortest-paths algo
 rithms such as those of Bellman-Ford and Dijkstra can be generalized to co
 mmutative and idempotent semirings. This course will review the basics of 
 this theory\, as well as some further generalizations that go beyond semir
 ings. For the core material I will attempt to condense those parts\nof the
  2001 book\n\n* Graphes\, dioides et semi-anneaux : Nouveaux modèles et a
 lgorithmes by Michel Gondran\, Michel Minoux\n\nwhich I have found to be m
 ost relevant to network routing.\nNo previous knowledge of the area will b
 e assumed.\n\n
LOCATION:Computer Laboratory\, Room FW11
END:VEVENT
END:VCALENDAR