课题基金 / 基金详情

Career: Approximation Algorithms: Methodology and Applications

Career: Approximation Algorithms: Methodology and Applications
职业:近似算法:方法论和应用
批准号:
9623859
负责人:
Michel Goemans
金额:
$20.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
1996
资助国家:
美国
项目状态:
已结题
起止时间:
1996-07-01 至 2001-06-30

项目摘要

项目成果

Michel Goemans的其他基金

相似基金

相关文献

中文摘要
翻译
该项目的重点是设计和分析NP难问题的快速近似算法,具有良好的性能保证。 尽管最近的强有力的结果对硬度的近似,PI和他的博士学位。学生们在引入设计和分析近似算法的新方法,以及改进广泛问题的最佳性能保证方面发挥了重要作用。 具体而言,本项目的目标包括:(1)开发和改进设计和分析近似算法的方法;(2)改进性能保证的近似算法的偏差,用于各种组合问题;(3)在电子工程和计算机科学中出现的重要实际问题的实际解决方案,在计算分子生物学中,和材料科学。 这项职业资助的综合教育计划包括:(1)本科生参与开发基于近似算法的高效软件代码;(2)开发针对不断变化的就业市场的本科生和研究生课程;(3)开发关于优化算法的多媒体教科书。
英文摘要
This project focuses on designing and analyzing fast approximation algorithms for NP-hard problems, with good performance guarantees. Despite the recent strong results on the hardness of approximations, the PI and his Ph.D. Student have been instrumental in introducing new methodologies for designing and analyzing approximation algorithms, and in improving the best known performance guarantees for a wide range of problems. In particular, the goals of this project include: (1) Development and refinement of methodologies to design and analyze approximation algorithms; (2) The deviation of approximation algorithms with improved performance guarantees for a variety of combinatorial problems;(3)The actual solution of important practical problems, arising in electrical engineering and computer science, in computational molecular biology, and in material science. The Integrated Educational Plan of this CAREER Grant includes: (1) Involvement of undergraduates in developing efficient software codes based on approximation algorithms; (2) Development of undergraduate and graduate course which address the changing job markets; (3) Development of a multimedia textbook on optimization algorithms.***
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: New Approaches to Fundamental Problems in Network Design
Polyhedral Techniques for the Design of Approximation Algorithms
Conference Proposal: CRM Theme Semester on Combinatorial Optimization (June 2006 - December 2006)
Design and Analysis of Algorithms - New Paradigms, Methodologies and Applications
海外基金