Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (Q2046266): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Dong-lei Du / rank | |||
Property / author | |||
Property / author: Chen-Chen Wu / rank | |||
Property / author | |||
Property / author: Dong-lei Du / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Chen-Chen Wu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10898-021-01014-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3142764332 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 22:26, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint |
scientific article |
Statements
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint (English)
0 references
17 August 2021
0 references
The authors propose a threshold greedy algorithm for the problem of maximizing the sum of a monotone non-negative diminishing return submodular function and a monotone non-negative supermodular function on the integer lattice with a cardinality constraint. The relation between the value of the solution returned by the proposed algorithm and the optimal solution value is estimated by a constant. With this purpose the authors introduce a concept of the total curvature on the integer lattice for a monotone non-decreasing non-negative submodular function and for a monotone non-negative supermodular function. They also formulate a linear program whose objective function approximates the estimated relation.
0 references
submodular function
0 references
supermodular function
0 references
integer lattice
0 references
cardinality constraint
0 references
threshold greedy algorithm
0 references