New Directions in Approximation Algorithms
New Directions in Approximation Algorithms
批准号:
0430751
负责人:
Ramamoorthi Ravi
金额:
$0.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2004
资助国家:
美国
项目状态:
已结题
起止时间:
2004-09-01 至 2008-08-31
中文摘要
该提案寻求继续资助PI在近似算法的主要研究领域的工作。PI的研究小组以前的NSF资助的工作已经成功地制定和解决了几个有趣的近似问题,包括批量购买网络设计,$k$-最小生成树,组斯坦纳树和度有界的最小生成树问题。我们在这一领域的贡献包括数学规划放松的困难问题和新的方法来轮这样的放松使用确定性和随机舍入技术,以及新的问题formulations. This建议的重点是解决的解决方案计算困难的问题在静脉的近似算法通过移动更接近现实世界的约束。具体来说,我们提出的工作方向包括将集成,异质性,竞争,不确定性和混合输入模型到经典问题。该提案报告了在每一个方向上取得的初步成功和正在进行的调查,并提出了具体的新问题和办法。该提案的智力价值是推动近似算法的前沿,扩大其范围和适用性,以及发现新的潜在技术的潜力。该提案辅之以教育和推广计划,继续PI参与更广泛的教育目标,如参与调查,辅导和教学研讨会,以及新课程和讲义的开发。该提案的更广泛的影响包括研究生培训和安置在这一研究领域,以及广泛的教育计划,旨在增加传播PI的研究,以更广泛的受众,包括四年制大学讲师。
英文摘要
This proposal seeks continued funding for the PI's work in his principal research area of Approximation Algorithms. Previous NSF-funded work by the PI's research group has successfully formulated and solved several interesting problems for approximation including the Buy-at-Bulk Network Design, $k$-Minimum Spanning Tree, Group Steiner Tree, and the Degree-bounded Minimum Spanning Tree problems. Our contributions to this area include mathematical programming relaxations of hard problems and novel ways to round such relaxations using deterministic and randomized rounding techniques, as well as new problem formulations.The focus of this proposal is to address the solution of computationally hard problems in the vein of approximation algorithms by moving closer to more real-world constraints.Specifically, we propose work in directions involving incorporating integration, heterogeneity, competition, uncertainty, and hybrid input models into classical problems. The proposal reports on preliminary successes and ongoing investigation in each of these directions, and formulates specific new problems and approaches. The intellectual merit of the proposal is to push the frontiers of approximation algorithms in terms of expanding its scope and applicability, as well as the potential for discovery of new underlying techniques.The proposal is complemented with an educational and outreach plan that continues the PI's involvement in broader educational goals such as participation in surveys, tutorials and teaching workshops, as well as new course and lecture note development. Thebroader impact of the proposal include graduate student training and placement in this research area as well as an extensive education plan aimed at increased dissemination of the PI's research to a broader audience including four-year college lecturers.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Preliminary Algorithmic Foundations for Ranking Quizzes and Students from Student-sourced Quizzes
-
批准号:1655442
-
项目类别:Standard Grant
-
资助金额:$14.8万
-
财政年份:2016
-
负责人:Ramamoorthi Ravi
-
依托单位:
AF: SMALL: Approximation Algorithms Matching Integrality Gaps for Network Design
-
批准号:1527032
-
项目类别:Standard Grant
-
资助金额:$40.0万
-
财政年份:2015
-
负责人:Ramamoorthi Ravi
-
依托单位:
Information Procuration via Adaptive Algorithms
-
批准号:1347308
-
项目类别:Standard Grant
-
资助金额:$9.97万
-
财政年份:2013
-
负责人:Ramamoorthi Ravi
-
依托单位:
AF: Small: Approximation Algorithms for Network Design
-
批准号:1218382
-
项目类别:Standard Grant
-
资助金额:$35.0万
-
财政年份:2012
-
负责人:Ramamoorthi Ravi
-
依托单位:
EAGER: New Techniques for Graph-TSP
-
批准号:1143998
-
项目类别:Standard Grant
-
资助金额:$9.93万
-
财政年份:2011
-
负责人:Ramamoorthi Ravi
-
依托单位:
Approximation Algorithms for Network Optimization
-
批准号:0728841
-
项目类别:Standard Grant
-
资助金额:$25.13万
-
财政年份:2007
-
负责人:Ramamoorthi Ravi
-
依托单位:
Graph-theoretic Approximation Algorithms
-
批准号:0105548
-
项目类别:Continuing Grant
-
资助金额:$20.73万
-
财政年份:2001
-
负责人:Ramamoorthi Ravi
-
依托单位:
CAREER: Approximation algorithms for NP-hard problems in networks and biology
-
批准号:9625297
-
项目类别:Continuing Grant
-
资助金额:$20.0万
-
财政年份:1996
-
负责人:Ramamoorthi Ravi
-
依托单位:
海外基金