Algorithm engineering for generic subset optimization problems
Published in Common Library Network (Der Gemeinsame Bibliotheksverbund) • Jan 1, 2024
Authors:
Woydt, Henning
Abstract
The Cardinality Constrained Maximization problem for submodular monotone set functions arises in many problems like Group Closeness Centrality and k Medoid Clustering. Submodular set functions encode a diminishing return, while monotone set functions never decrease in value. Due to the NP-hard natur...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!