论文标题
与关联子集的集合的最小重量分区
Minimum-weight partitioning of a set with associated subsets
论文作者
论文摘要
该论文为在软件测试和制造中出现的优化问题的近似算法家庭提供了复杂性结果和性能保证。该问题被公正为一个集合的分区，其中每个元素在另一个集合中都有关联的子集，但也可以将其视为无限较大的通信延迟，以双分式图的形式的优先限制和重复的计划问题。
The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing. The problem is formulated as a partitioning of a set where each element has an associated subset in another set, but can also be viewed as a scheduling problem with infinitely large communication delay, precedence constraints in the form of a bipartite graph, and duplication.
