Maximizing k-submodular functions under budget constraint: applications and streaming algorithms
From MaRDI portal
(Redirected from Publication:2168767)
Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
Recommendations
- Streaming algorithms for maximizing monotone DR-submodular functions with a cardinality constraint on the integer lattice
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Streaming submodular maximization under \(d\)-knapsack constraints
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
- Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- An analysis of approximations for maximizing submodular set functions—I
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Derandomization for k-submodular maximization
- Fast algorithms for maximizing submodular functions
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Improved approximation algorithms for \(k\)-submodular function maximization
- Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing bisubmodular and \(k\)-submodular functions
- Maximizing social influence in nearly optimal time
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- On maximizing a monotone \(k\)-submodular function under a knapsack constraint
- Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Cited in
(14)- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint
- Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
- \textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- An improved analysis of the Greedy+Singleton algorithm for \(k\)-submodular knapsack maximization
- Random approximation algorithms for monotone \(k\)-submodular function maximization with size constraints
- Profit maximization for competitive influence spread in social networks
- Efficient algorithms for k-submodular function maximization with p-system and d-knapsack constraint
- \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- On maximizing k-submodular functions under p-system and d-knapsack constraints
- Streaming algorithms for maximizing k-submodular functions with the multi-knapsack constraint
- Streaming algorithms for maximizing k-submodular functions under a partition matroid constraint
- Approximation algorithms for k-submodular maximization subject to a knapsack constraint
- k-submodular maximization under individual knapsack constraints: applications and streaming algorithm
- Approximation algorithms for k-submodular maximization under fairness constraints and size constraints
This page was built for publication: Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168767)
