Deterministic approximation algorithm for submodular maximization subject to a matroid constraint
•Present a deterministic approximation algorithm for submodular maximization with a curvature parameter α.•Generalize the previous deterministic 0.5008-approximation due to Buchbinder et al., achieving an identical ratio of 0.5008 when α=1.•Achieve a ratio of 1 for α=0 for which the function is actu...
Saved in:
Published in | Theoretical computer science Vol. 890; pp. 1 - 15 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
12.10.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!