Minimum-weight partitioning of a set with associated subsets

12/12/2022
by   Yakov Zinder, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2010

Multi-Criteria Evaluation of Partitioning Schemes for Real-Time Systems

In this paper we study the partitioning approach for multiprocessor real...
research
01/18/2021

Dynamic Longest Increasing Subsequence and the Erdös-Szekeres Partitioning Problem

In this paper, we provide new approximation algorithms for dynamic varia...
research
11/21/2020

Erdös-Szekeres Partitioning Problem

In this note, we present a substantial improvement on the computational ...
research
11/06/2017

The TensorFlow Partitioning and Scheduling Problem: It's the Critical Path!

State-of-the-art data flow systems such as TensorFlow impose iterative c...
research
04/04/2018

Losing Treewidth by Separating Subsets

We study the problem of deleting the smallest set S of vertices (resp.ed...
research
03/27/2018

A Faster FPTAS for the Subset-Sums Ratio Problem

The Subset-Sums Ratio problem (SSR) is an optimization problem in which,...

Please sign up or login with your details

Forgot password? Click here to reset