k-Submodular maximization with two kinds of constraints

DOI10.1142/S1793830921500361zbMath1475.90086OpenAlexW3092405154MaRDI QIDQ5013487

Weili Wu, Shuyang Gu, Ganquan Shi

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500361

zbMATH Keywords

size constraint\(k\)-submodular maximizationdecreasing threshold

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Group fairness in non-monotone submodular maximization

Cites Work

• Unnamed Item
• Derandomization for \(k\)-submodular maximization
• Combinatorial auctions with decreasing marginal utilities
• Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
• Maximizing Non-monotone Submodular Functions
• A threshold of ln n for approximating set cover
• Towards Minimizing k-Submodular Functions
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
• An improved approximation algorithm for combinatorial auctions with submodular bidders
• Deterministic Algorithms for Submodular Maximization Problems
• Improved Approximation Algorithms for k-Submodular Function Maximization
• An Exact Algorithm for Maximum Entropy Sampling
• Maximizing k -Submodular Functions and Beyond
• Fast algorithms for maximizing submodular functions
• Automata, Languages and Programming
• Improved Randomized Algorithm for k-Submodular Function Maximization

This page was built for publication: k-Submodular maximization with two kinds of constraints