Algorithmic Techniques for Optimization in Graphs

这个项目研究优化的算法技术，重点是与图相关的问题。我们的目标是更快、更节省空间的算法。一个特别的焦点是使用半定规划建模图优化问题。目前正在研究一种近似求解半定规划问题的新方法。以半定规划的工作为指导，本项目研究了提高一类优化近似算法的效率。

This project investigates algorithmic techniques for optimization, with an emphasis on problems related to graphs. The goal is faster and more space-efficient algorithms. A special focus is the use of semidefinite programming for modelling graph optimization problems. A new approach to approximately solving semidefinite programming problems is being pursued. Using the work on semidefinite programming as a guide, the project studies improving the efficiency of a broad class of approximation algorithms for optimization.