Approximation Algorithms for Network-Design and Transportation Problems

该项目致力于开发几个网络设计问题的实用算法，包括与图连通性相关的问题。另一个研究领域是与旅行商问题密切相关的有能力的车辆路径问题。在给定分布在不同位置的对象集合的情况下，问题是使用有限容量的车辆将对象递送到指定位置。这些问题出现在货物运输和机器人的运动规划中。

This project is concerned with the development of practical algorithms for several network design problems, including problems related to graph connectivity.Another area studied is capacitated vehicle routing, which is closely related to the Traveling Salesman Problem. Given a collection of objects distributed at different locations, the problem is to deliver the objects to specified locations using a vehicle of bounded capacity. Such problems arise in transportation of goods and motion-planning of robots.