Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
From MaRDI portal
Publication:2168767
DOI10.1007/s10878-022-00858-xzbMath1498.90199OpenAlexW4223972941MaRDI QIDQ2168767
Canh V. Pham, Tai Terje Huu Nguyen, Quang C. Vu, Dung K. T. Ha, Nguyen D. Le
Publication date: 26 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00858-x
Related Items (2)
Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint ⋮ \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
Cites Work
- Unnamed Item
- Unnamed Item
- Submodular maximization meets streaming: matchings, matroids, and more
- A note on maximizing a submodular set function subject to a knapsack constraint
- Derandomization for \(k\)-submodular maximization
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- An analysis of approximations for maximizing submodular set functions—I
- Improved Approximation Algorithms for k-Submodular Function Maximization
- Maximizing Social Influence in Nearly Optimal Time
- Maximizing Bisubmodular and k-Submodular Functions
- Fast algorithms for maximizing submodular functions
This page was built for publication: Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
