An accelerated deterministic algorithm for maximizing monotone submodular minus modular function with cardinality constraint
Submodular optimization not only covers some classical combinatorial optimization problems, but also has a wide range of applications in fields such as machine learning and artificial intelligence. For submodular maximization problems with constraints, some work has been done including the design of...
Saved in:
| Published in: | Theoretical computer science Vol. 1016; p. 114798 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
12.11.2024
|
| Subjects: | |
| ISSN: | 0304-3975 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!