共 50 条
- [3] On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint [J]. COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 75 - 85
- [4] Maximizing a submodular set function subject to a matroid constraint (Extended abstract) [J]. INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2007, 4513 : 182 - +
- [6] Maximizing a monotone non-submodular function under a knapsack constraint [J]. Journal of Combinatorial Optimization, 2022, 43 : 1125 - 1148
- [7] On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints [J]. Journal of Combinatorial Optimization, 2023, 45
- [10] Maximization of k-Submodular Function with a Matroid Constraint [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2022, 2022, 13571 : 1 - 10