Minimum-weight partitioning of a set with associated subsets
Data Structures and Algorithms
2022-12-13 v1
Abstract
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.
Cite
@article{arxiv.2212.05823,
title = {Minimum-weight partitioning of a set with associated subsets},
author = {Yakov Zinder and Bertrand M. T. Lin and Joanna Berlińska},
journal= {arXiv preprint arXiv:2212.05823},
year = {2022}
}