Grant: Discovery Grants Program - Individual
University of Manitoba
$10,000.00
Algorithms for some combinatorial problems
FY 2008-09
Summary
The main theme of my research is the study of algorithms for solving combinatorial problems. Combinatorics is relevant in many areas of computer science including cryptography, communication networks and bio-informatics. To focus my research, I will investigate the following: 1) degree sequences for k-hypergraphs, and 2) multilevel cooperative search and combinatorial designs. The study of degree sequences for k-hypergraphs is an important open problem in hypergraph theory. Although many people have studied this problem, there is no known simple characterization of the polytope of valid degree sequences for k-hypergraphs. Such a characterization would be a major breakthough. I propose to study the polytope of valid degree sequences of 3-hypergraphs using an a linear-time algorithm that I have recently discovered. By applying the algorithm, I hope to find new information about this polytope. In the second project, I propose to investigate the application of the multilevel cooperative search strategy to optimization problems derived from combinatorial design theory. This is a new approach to solving combinatorial design optimization problems, and it often performs better than meta-heuristic search techniques such as genetic algorithms, simulated annealing and tabu search. Recently, I applied the multilevel cooperative search strategy to the covering design problem and noticed that it performed very well as was able to discover some new results with this search strategy. I propose to investigate why the multilevel cooperative search works better than meta-heuristic searchs such as simulated annealing and tabu search, for certain covering design problem instances and hope to determine conditions under which this search method will perform well. In addition, I would like to investigate the possibility of applying the multilevel cooperative search to other combinatorial design optimization problems, such as Latin squares, t-designs and lotto designs.
Program
Discovery Grants Program - Individual
Recipient
Location
Manitoba, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
250389-2006
Name nom
Li, PakChing(Ben)
Department département
Computer Science
Organization id
19
Institution établissement
University of Manitoba
Province en
Manitoba
Province fr
Manitoba
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2006
Award amount
10000
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
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
3
Nb partie
5
Application title
Algorithms for some combinatorial problems
Keyword
NA
Application summary
The main theme of my research is the study of algorithms for solving combinatorial problems. Combinatorics is relevant in many areas of computer science including cryptography, communication networks and bio-informatics. To focus my research, I will investigate the following: 1) degree sequences for k-hypergraphs, and 2) multilevel cooperative search and combinatorial designs. The study of degree sequences for k-hypergraphs is an important open problem in hypergraph theory. Although many people have studied this problem, there is no known simple characterization of the polytope of valid degree sequences for k-hypergraphs. Such a characterization would be a major breakthough. I propose to study the polytope of valid degree sequences of 3-hypergraphs using an a linear-time algorithm that I have recently discovered. By applying the algorithm, I hope to find new information about this polytope. In the second project, I propose to investigate the application of the multilevel cooperative search strategy to optimization problems derived from combinatorial design theory. This is a new approach to solving combinatorial design optimization problems, and it often performs better than meta-heuristic search techniques such as genetic algorithms, simulated annealing and tabu search. Recently, I applied the multilevel cooperative search strategy to the covering design problem and noticed that it performed very well as was able to discover some new results with this search strategy. I propose to investigate why the multilevel cooperative search works better than meta-heuristic searchs such as simulated annealing and tabu search, for certain covering design problem instances and hope to determine conditions under which this search method will perform well. In addition, I would like to investigate the possibility of applying the multilevel cooperative search to other combinatorial design optimization problems, such as Latin squares, t-designs and lotto designs.