Maximization of \(k\)-submodular function with a matroid constraint

DOI10.1007/978-3-031-20350-3_1MaRDI QIDQ6111937

No author found.

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

randomized algorithmmatroid constraintdeterministic algorithm\(k\)-submodular function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

\textsc{Greedy+Singleton}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization

Cites Work

• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
• Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint
• Towards Minimizing k-Submodular Functions
• Ottimizzazione Combinatoria
• Improved Approximation Algorithms for k-Submodular Function Maximization
• Maximizing k -Submodular Functions and Beyond
• Bisubmodular Function Minimization
• Improved Randomized Algorithm for k-Submodular Function Maximization

This page was built for publication: Maximization of \(k\)-submodular function with a matroid constraint