or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint

Haifeng Huang; Qian Liu; Yang Zhou; Min Li

doi:10.1007/978-981-97-7798-3_13

ScienceGate Book Chapters

BOOK-CHAPTER

or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint

Haifeng Huang Qian Liu Yang Zhou Min Li

Year: 2024 Lecture notes in computer science Pages: 145-156 Publisher: Springer Science+Business Media

DOI: 10.1007/978-981-97-7798-3_13

Get Full-Text PDF Get Analytical Report

Keywords:

Knapsack problem Matroid Submodular set function Constraint (computer-aided design) Computer science Maximization Mathematical optimization Combinatorics Mathematics Algorithm

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.46

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

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint

Metrics

Topics

Related Documents

Weakly k-submodular Maximization Under Matroid Constraint

$k$-Submodular Maximization with a Knapsack Constraint and $p$ Matroid Constraints

Deletion-Robust Submodular Maximization under a Knapsack Constraint

Fair Submodular Maximization over a Knapsack Constraint

Submodular + Supermodular function maximization with knapsack constraint