Maximizing approximately non-\(k\)-submodular monotone set function with matroid constraint

DOI10.1007/978-3-031-20350-3_2OpenAlexW4313349761MaRDI QIDQ6111938

Yi-Jing Wang, Weina Ye, Yanjun Jiang, Ruiqi Yang

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_2

zbMATH Keywords

approximation algorithmmatroidgreedy\(k\)-submodular set function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
• On maximizing a monotone \(k\)-submodular function under a knapsack constraint
• Maximizing k -Submodular Functions and Beyond

This page was built for publication: Maximizing approximately non-\(k\)-submodular monotone set function with matroid constraint