On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
From MaRDI portal
Publication:2697144
DOI10.1007/s10878-023-01021-wOpenAlexW4365149676MaRDI QIDQ2697144
Min Li, Yang Zhou, Kemin Yu, Qian Liu
Publication date: 18 April 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01021-w
Related Items (1)
Cites Work
- A note on maximizing a submodular set function subject to a knapsack constraint
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Maximization problems of balancing submodular relevance and supermodular diversity
- Constrained submodular maximization via greedy local search
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
- Towards Minimizing k-Submodular Functions
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- An analysis of approximations for maximizing submodular set functions—I
- Improved Approximation Algorithms for k-Submodular Function Maximization
- Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint
- Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- Improved Randomized Algorithm for k-Submodular Function Maximization
This page was built for publication: On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
