Streaming submodular maximization under d-knapsack constraints

Zihan Chen; Bin Liu; Hongmin W. Du

doi:10.1007/s10878-022-00951-1

ScienceGate Book Chapters

JOURNAL ARTICLE

Streaming submodular maximization under d-knapsack constraints

Zihan Chen Bin Liu Hongmin W. Du

Year: 2022 Journal: Journal of Combinatorial Optimization Vol: 45 (1) Publisher: Springer Science+Business Media

DOI: 10.1007/s10878-022-00951-1

Get Full-Text PDF Get Analytical Report

Keywords:

Knapsack problem Submodular set function Theory of computation Maximization Mathematical optimization Mathematics Combinatorics Computer science Algorithm

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.20

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Streaming submodular maximization under d-knapsack constraints

Metrics

Topics

Related Documents

k-Submodular Maximization Under Individual Knapsack Constraints: Applications and Streaming Algorithm

Adversarially Robust Submodular Maximization under Knapsack Constraints

Streaming Submodular Maximization Under Matroid Constraints

Two-Stage Submodular Maximization Under Knapsack and Matroid Constraints

Non-monotone submodular maximization under matroid and knapsack constraints