Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

McGill University

$30,000.00

Algorithms, graphs and polyhedra

EF 2008-09

Résumé
The main focus of research is the algorithmic theory of network routing and design. The PI's previous position in industry provided continual exposure to new fundamental research problems arising from real technological constraints (such as those for optically-switched networks or traffic engineering and network routing protocols). The PI is also exploring connections between geometric relaxations for combinatorial optimization problems and efficient algorithms with provable approximation guarrantees. In the latter endeavour, techniques from polyhedral combinatorics are especially exploited.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
342457-2007
Name nom
Shepherd, Bruce
Department département
Mathematics and Statistics
Organization id
61
Institution établissement
McGill University
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
30000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
2
Nb partie
3
Application title
Algorithms, graphs and polyhedra
Keyword
NA
Application summary
The main focus of research is the algorithmic theory of network routing and design. The PI's previous position in industry provided continual exposure to new fundamental research problems arising from real technological constraints (such as those for optically-switched networks or traffic engineering and network routing protocols). The PI is also exploring connections between geometric relaxations for combinatorial optimization problems and efficient algorithms with provable approximation guarrantees. In the latter endeavour, techniques from polyhedral combinatorics are especially exploited.