Two-stage submodular maximization under curvature

DOI10.1007/978-3-030-92681-6_3OpenAlexW4205601806MaRDI QIDQ5918724

Yanzhi Li, Hong Chang, Ping Li, Xiaoyan Zhang, Chuchu Xu, Zhi-cheng Liu

Publication date: 29 June 2022

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_3

zbMATH Keywords

approximation algorithmcurvaturesubmodular termtwo-stage submodular maximization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• IMDB

Cites Work

• Unnamed Item
• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A constrained two-stage submodular maximization
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

This page was built for publication: Two-stage submodular maximization under curvature