An improved analysis of the Greedy+Singleton algorithm for k-submodular knapsack maximization
From MaRDI portal
Publication:6535797
DOI10.1007/978-3-031-39344-0_2MaRDI QIDQ6535797FDOQ6535797
Authors: Zhongzheng Tang, Jingwen Chen, Chenhao Wang 
Publication date: 28 February 2024
Cites Work
- The budgeted maximum coverage problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Maximizing k -Submodular Functions and Beyond
- Maximization of \(k\)-submodular function with a matroid constraint
- Towards minimizing \(k\)-submodular functions
- On \(k\)-submodular relaxation
- Improved approximation algorithms for \(k\)-submodular function maximization
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- A refined analysis of submodular greedy
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- An exact cutting plane method for \(k\)-submodular function maximization
- Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints
- Improved Randomized Algorithm for k-Submodular Function Maximization
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
- Practical budgeted submodular maximization
Cited In (1)
This page was built for publication: An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535797)
