-Develop theortetical techniques to analyze greedy heuristics with non-submodular potentail functions. -Develop new techniques, design approximations with better performance ratio for some classical optimization -Find new heuristics with better computational performance

Broader Impact

-Enhance advanced theory of optimization and algorithmic study in optimization -Research will involve graduate students

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Type
Standard Grant (Standard)
Application #
0514796
Program Officer
William H Tranter
Project Start
Project End
Budget Start
2005-08-15
Budget End
2010-07-31
Support Year
Fiscal Year
2005
Total Cost
$250,804
Indirect Cost
Name
University of Texas at Dallas
Department
Type
DUNS #
City
Richardson
State
TX
Country
United States
Zip Code
75080