RUI: Approximation Algorithms for Scheduling Problems

排序问题是计算机科学中研究最广泛的一类问题。 这些问题有几个应用领域，例如，大规模的通信网络。 有强有力的证据表明，大多数类型的调度问题不能在合理的时间内得到最佳解决。 然而，许多排序问题的近似最优解的问题尚未得到解决。 这项研究的目标是开发新的技术，以确定哪些调度问题可以在合理的计算时间内近似最优地解决，并为正例开发有效的算法。甘地博士在为这种研究做好本科生准备方面有着出色的记录，这个项目继续他的计划，帮助罗格斯大学卡姆登分校的学生通过与他们密切合作来发现自己的潜力--与他们一起研究问题，指导他们，并鼓励他们对离散数学和算法的兴趣。

Scheduling problems are among the most widely studied class of problems in Computer Science. These problems have applications is several areas, e.g., in large-scale communication networks. There is strong evidence that most kinds of scheduling problems cannot be optimally solved in a reasonable amount of time. However, the question of finding approximately optimal solutions for many kinds of scheduling problems is unresolved. The goal of this research is to develop new techniques to determine which scheduling problems can be solved approximately optimally in a reasonable amount of computing time, and to develop efficient algorithms for the positive examples.Dr. Gandhi has an excellent record of preparing undergraduates for this kind of research, as well as guiding them in it. This project continues his program of helping students at Rutgers Camden to discover their own potential by working very closely with them -- working on research problems with them, mentoring them, and encouraging their interest in discrete mathematics and algorithms.