Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Paper
A note on maximizing a submodular set function subject to a knapsack constraint
Abstract
A note on maximizing a submodular set function subject to a knapsack constraint was presented. An (1-e-1)-approximation algorithm for maximizing a nondecreasing submodular set function was obtained. This algorithm required O(n5) function value computations. The algorithm enumerated all feasible solutions of cardinality one or two.
Related
M. Shub, B. Weiss
Ergodic Theory and Dynamical Systems
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Conference paper
Generative Adversarial Symmetry Discovery
Jianke Yang, Robin Walters, et al.
ICML 2023