Réunion d'hiver SMC 2010
Coast Plaza Hotel and Suites, Vancouver, 4 - 6 décembre 2010

Conférence publique

RON GRAHAM, University of California at San Diego
Searching for the Shortest Network  [PDF]

Suppose you are given some set of cities and you would like to connect them all together with a network having the shortest possible total length. How hard is it to find such a shortest network? This classical problem has challenged mathematicians for nearly two centuries, and today has great relevance in such diverse areas as telecommunication networks, the design of VLSI chips and molecular phylogenetics. In this talk, I will summarize past accomplishments, present activities and future challenges for this fascinating topic.


AARMS: Atlantic Association for Research in the Mathematical Sciences Centre de recherches mathématiques Fields Institute MITACS Pacific Institute for the Mathematical Sciences University of British Columbia Simon Fraser University University of Alberta University of Victoria

© Société mathématique du Canada :