课题基金 / 基金详情

Flexible and Effective Techniques for the Design of Approximation Algorithms

Flexible and Effective Techniques for the Design of Approximation Algorithms
灵活有效的逼近算法设计技术
批准号:
288340-2012
负责人:
Könemann, Jochen
金额:
$3.06万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2015
资助国家:
加拿大
项目状态:
已结题
起止时间:
2015-01-01 至 2016-12-31

项目摘要

项目成果

Könemann, Jochen的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Discrete optimization problems are abundant in everyday life, and arise whenever complex decisions about the efficient distribution of scarce resources have to be made. There is a plethora of such problems, including the timely scheduling of trains in a local transit network, and the optimal layout of wires in the VLSI design phase of a modern chip. In these two examples, and in general, relevant practical instances are often NP-hard, and thus intractable. This proposal focuses on the design of Approximation Algorithms that efficiently compute near-optimal solutions to given optimization problems. Emphasis will be placed on the systematic use of mathematical programming (MP) in the design of such algorithms. MP is an important tool in the development of approximation algorithms. Starting from a mathematical model of a problem, one typically first derives a strong and tractable relaxation, solves it, and ultimately rounds its solution into one that is feasible for the original problem. The performance ratio of such an algorithm chiefly depends on two main factors: the quality of the MP relaxation, and the rounding method. While several powerful and general purpose methods for the above rounding process have been developed in the last 30 years, the following meta question (paraphrased from Vazirani's book) remains: Given a strong MP relaxation, is there always a way of rounding it into a good solution for the underlying optimization problem? Shedding light on this question is the long-term goal of my research. More explicitly, in my research program I intend to systematically study the use of strong MP relaxations in the design of approximation algorithms. I give three examples of ongoing projects together with several example short-term goals. The proposed research objectives are central in Combinatorial Optimization and Theoretical Computer Science; progress made is anticipated to have significant direct impact in these fields, and in practical applications of MP. The proposed research program is a natural continuation of existing work, and it will continue to attract excellent students.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Flexible and Effective Techniques for the Design of Approximation Algorithms
  • 批准号:
    288340-2012
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $3.06万
  • 财政年份:
    2014
  • 负责人:
    Könemann, Jochen
  • 依托单位:
Flexible and Effective Techniques for the Design of Approximation Algorithms
  • 批准号:
    429614-2012
  • 项目类别:
    Discovery Grants Program - Accelerator Supplements
  • 资助金额:
    $2.91万
  • 财政年份:
    2014
  • 负责人:
    Könemann, Jochen
  • 依托单位:
Flexible and Effective Techniques for the Design of Approximation Algorithms
  • 批准号:
    288340-2012
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $3.06万
  • 财政年份:
    2013
  • 负责人:
    Könemann, Jochen
  • 依托单位:
Flexible and Effective Techniques for the Design of Approximation Algorithms
  • 批准号:
    429614-2012
  • 项目类别:
    Discovery Grants Program - Accelerator Supplements
  • 资助金额:
    $2.91万
  • 财政年份:
    2013
  • 负责人:
    Könemann, Jochen
  • 依托单位:
海外基金