GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
We describe a parallel approximation algorithm for maximizing monotone submodular functions subject to hereditary constraints on distributed memory multiprocessors. Our work is motivated by the need to solve submodular optimization problems on massive data sets, for practical contexts such as data s...
Saved in:
Main Authors | , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
15.03.2024
|
Subjects | |
Online Access | Get full text |
DOI | 10.48550/arxiv.2403.10332 |
Cover
Loading…