Efficient Algorithms for Multiple Instance Combinatorial Problems

这个项目将主要集中在多个实例的问题 网络流量计算许多重要的，非平凡的组合 问题可以作为一系列密切相关的问题来解决。 网络流量计算 最近的结果导致了改善 计算这种序列的效率，这反过来又导致了 快速解决重要的组合问题。 这个项目 我将把最近的工作，集中在一般方法，以具体 重要的组合问题。 特别是，两个一般类 将假设序列：参数网络流问题，其中 该序列是通过改变某些边的容量来生成的， 以及多源-汇问题，其中序列由 改变源节点和汇聚节点的选择。

This project will focus largely on problems of multiple instance network flow computations. Many important, non-trivial combinatorial problems can be cast and solved as a sequence of closely related network flow computations. Recent results have led to improved efficiency in computing such sequences, and in turn this has lead to faster solutions to important combinatorial problems. This project will extend recent work, concentrating on general methods to specific important combinatorial problems. In particular, two general classes of sequence will be assumed: parametric network flow problems, where the sequence is generated by changing the capacities of certain edges, and multiple source-sink problems, where the sequence are generated by changing the choices of source and sink nodes.