Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints

Zhicheng Liu; Jing Jin; Donglei Du; Xiaoyan Zhang

doi:10.1007/978-3-031-20350-3_13

ScienceGate Book Chapters

BOOK-CHAPTER

Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints

Zhicheng Liu Jing Jin Donglei Du Xiaoyan Zhang

Year: 2022 Lecture notes in computer science Pages: 140-154 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-031-20350-3_13

Get Full-Text PDF Get Analytical Report

Keywords:

Submodular set function Matroid Knapsack problem Combinatorics Constraint (computer-aided design) Maximization Mathematics Monotone polygon Similarity (geometry) Discrete mathematics Mathematical optimization Computer science Artificial intelligence

Metrics

Cited By

0.65

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints

Metrics

Citation History

Topics

Related Documents

Non-monotone submodular maximization under matroid and knapsack constraints

Submodular Maximization under the Intersection of Matroid and Knapsack Constraints

Non-Submodular Maximization with Matroid and Knapsack Constraints

Two-Stage Submodular Maximization Under Knapsack Problem

Streaming Submodular Maximization Under Matroid Constraints