Weakly \(k\)-submodular maximization under matroid constraint

DOI10.1007/978-3-031-20350-3_32OpenAlexW4313348920MaRDI QIDQ6111977

Zhenning Zhang, Yapu Zhang, Yi-Jing Wang, Dongmei Zhang

Publication date: 4 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_32

zbMATH Keywords

approximation algorithmsmatroid constraintcardinality constraintweak function\(k\)-submodular

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint
• Towards Minimizing k-Submodular Functions
• Improved Approximation Algorithms for k-Submodular Function Maximization
• Maximizing k -Submodular Functions and Beyond
• Maximizing Bisubmodular and k-Submodular Functions
• Improved Randomized Algorithm for k-Submodular Function Maximization

This page was built for publication: Weakly \(k\)-submodular maximization under matroid constraint