CAREER: Approximation Algorithms - New Directions and Techniques
CAREER: Approximation Algorithms - New Directions and Techniques
批准号:
0237113
负责人:
Moses Charikar
金额:
$40.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2003
资助国家:
美国
项目状态:
已结题
起止时间:
2003-07-01 至 2009-06-30
中文摘要
点击翻译按钮获取中文摘要
英文摘要
The theory of NP Completeness has shown that several naturallyoccurring problems are unlikely to have polynomial timealgorithms. One approach to overcome this fundamental intractabilityfor optimization problems has been to shift the focus from exactsolutions to obtaining approximate solutions. The study ofapproximation algorithms has thus emerged as a rich and exciting fieldand recent advances have led to good approximation algorithms forseveral fundamental optimization problems. Despite these developments,several interesting and difficult open problems remain. A primaryfocus of this career development plan is studying the approximabilityof fundamental problems and attempting to close such gaps in ourunderstanding.The broad research goals of this career development plan are thefollowing:1. Developing new tools to devise approximation algorithms for problems on directed graphs.2. Developing new techniques for metric approximations and embeddings as building blocks for approximation.3. Investigating a systematic way to obtain and exploitstrengthened SDPs as well as the use of strengthened SDPs for graph partitioning minimization problems and ordering problems.4. Devise techniques to deal with scheduling problems withprecedence constraints.5. Extend the machinery of approximation algorithms to newsettings such as information theoretic and algebraic problems.The research program will involve students at all levels, fromundergraduate projects on understanding the quality of LP and SDPrelaxations through computational experiments, to the mathematicalresearch suitable for Ph.D. students. The educational component ofthis project includes the development of courses geared towardsdisseminating new algorithmic ideas outside the theoretical computerscience community; the techniques developed in the latest researchwill be distilled into new graduate and undergraduate courses. Coursematerials developed for such new courses will be made freely availableto enable similar courses to be taught elsewhere.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: New Perspectives on Mathematical Programming Relaxations
-
批准号:1617577
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2016
-
负责人:Moses Charikar
-
依托单位:
AF: Small: Approximation Techniques for Combinatorial Optimization
-
批准号:1565581
-
项目类别:Standard Grant
-
资助金额:$13.06万
-
财政年份:2015
-
负责人:Moses Charikar
-
依托单位:
Funding Application for the Fourth Biennial Women-in-Theory Workshop (WIT)
-
批准号:1437283
-
项目类别:Standard Grant
-
资助金额:$5.0万
-
财政年份:2014
-
负责人:Moses Charikar
-
依托单位:
AF: Small: Approximation Techniques for Combinatorial Optimization
-
批准号:1218687
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2012
-
负责人:Moses Charikar
-
依托单位:
AF: Small: Mathematical Programming Methods in Approximation
-
批准号:0916218
-
项目类别:Standard Grant
-
资助金额:$50.0万
-
财政年份:2009
-
负责人:Moses Charikar
-
依托单位:
ITR Collaborative Research: ASE-DMC Computational Complexity of Interactive Computation
-
批准号:0426582
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:2004
-
负责人:Moses Charikar
-
依托单位:
Finite Metric Spaces and their Applications
-
批准号:0340986
-
项目类别:Standard Grant
-
资助金额:$0.6万
-
财政年份:2003
-
负责人:Moses Charikar
-
依托单位:
海外基金