Non-monotone k-Submodular Function Maximization with Individual Size Constraints
- 11 February 2023
- book chapter
- Published by Springer Nature
- p. 268-279
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On maximizing a monotone k-submodular function under a knapsack constraintOperations Research Letters, 2022
- Streaming Algorithms for Budgeted k-Submodular Maximization Problem2021
- Improved Randomized Algorithm for k-Submodular Function MaximizationSIAM Journal on Discrete Mathematics, 2021
- Maximizing Approximately k-Submodular Functions2021
- k-Submodular maximization with two kinds of constraintsDiscrete Mathematics, Algorithms and Applications, 2020
- Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical GuaranteeIEEE Transactions on Evolutionary Computation, 2017
- On maximizing a monotone -submodular function subject to a matroid constraintDiscrete Optimization, 2017
- Maximizing k -Submodular Functions and BeyondACM Transactions on Algorithms, 2016
- Improved Approximation Algorithms for k-Submodular Function Maximization2015
- Towards Minimizing k-Submodular Functions2012