Grant: Discovery Grants Program - Individual
University of Toronto
$74,000.00
""Design, analysis and theory of algorithms""
FY 2015-16
Summary
Algorithm design and analysis has seen significant progress in the sophistication of the algorithms being developed as well as in the expanding set of application areas where recent algorithms have become essential. However, algorithm design still remains mainly an art. The goal of this research project is to make algorithm design somewhat more of a science than an art. Namely, we wish to help develop a theory of algorithms that would allow us to better understand the benefits and limitations of general algorithmic approaches as applied to various problem domains. This general project is admittedly both too vague and too ambitious. So in more pragmatic terms, I am studying the power and limitations of well known ""conceptually simple meta algorithms"" such as greedy algorithms, dynamic programming, primal dual/local ratio algorithms and local search algorithms. To do so, we propose precise models that capture particular instances of such algorithms in relation to a wide variety of problem domains. We proceed to both design and analyze algorithms within a particular framework and as well to establish impossibility results (e.g. inapproximination bounds) with respect to the model. This approach stands in contrast to the fundamental limitations one tries to establish vis a vis complexity bounds (e.g. what can and cannot be computed in polynomial time or logarithmic space). Rather we try to establish limitations independent of complexity issues but instead establish such limitations based on the restricted design of the algorithm. In particular, we prove results that hold whether or not P = NP.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
7631-2012
Name nom
Borodin, Allan
Department département
Computer Science (St. George Campus)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2012
Award amount
74000
Program id
RGPIN
Program name 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
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
4
Nb partie
5
Application title
""Design, analysis and theory of algorithms""
Keyword
NSERC
Application summary
Algorithm design and analysis has seen significant progress in the sophistication of the algorithms being developed as well as in the expanding set of application areas where recent algorithms have become essential. However, algorithm design still remains mainly an art. The goal of this research project is to make algorithm design somewhat more of a science than an art. Namely, we wish to help develop a theory of algorithms that would allow us to better understand the benefits and limitations of general algorithmic approaches as applied to various problem domains. This general project is admittedly both too vague and too ambitious. So in more pragmatic terms, I am studying the power and limitations of well known ""conceptually simple meta algorithms"" such as greedy algorithms, dynamic programming, primal dual/local ratio algorithms and local search algorithms. To do so, we propose precise models that capture particular instances of such algorithms in relation to a wide variety of problem domains. We proceed to both design and analyze algorithms within a particular framework and as well to establish impossibility results (e.g. inapproximination bounds) with respect to the model. This approach stands in contrast to the fundamental limitations one tries to establish vis a vis complexity bounds (e.g. what can and cannot be computed in polynomial time or logarithmic space). Rather we try to establish limitations independent of complexity issues but instead establish such limitations based on the restricted design of the algorithm. In particular, we prove results that hold whether or not P = NP.