Non-monotone submodular function maximization under \(k\)-system constraint

DOI10.1007/s10878-020-00672-3zbMath1468.90115OpenAlexW3103000982MaRDI QIDQ2025102

Zishen Yang, Donghyun Kim, Majun Shi, Wei Wang

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00672-3

zbMATH Keywords

\(k\)-systemsubmodular maximizationmodified-greedy algorithmNMSFMk algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Greedy guarantees for non-submodular function maximization under independent system constraint with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• Submodular functions and optimization.
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
• Maximizing Non-monotone Submodular Functions
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• An analysis of approximations for maximizing submodular set functions—I
• Deterministic Algorithms for Submodular Maximization Problems
• Symmetry and Approximability of Submodular Maximization Problems
• Non-monotone submodular maximization under matroid and knapsack constraints
• Submodular Maximization with Cardinality Constraints
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
• A Unified Continuous Greedy Algorithm for Submodular Maximization

This page was built for publication: Non-monotone submodular function maximization under \(k\)-system constraint