Streaming Algorithms for Monotone DR-Submodular Maximization Under a Knapsack Constraint on the Integer Lattice

2021 ◽  
pp. 58-67
Author(s):  
Jingjing Tan ◽  
Dongmei Zhang ◽  
Hongyang Zhang ◽  
Zhenning Zhang
Keyword(s):  
Integer Lattice ◽  
Streaming Algorithms ◽  
Knapsack Constraint ◽  
Submodular Maximization

scholarly journals Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint

2021 ◽  
Vol 5 (1) ◽  
pp. 1-22
Author(s):  
Jing Tang ◽  
Xueyan Tang ◽  
Andrew Lim ◽  
Kai Han ◽  
Chongshou Li ◽  
...  
Keyword(s):  
Approximation Algorithms ◽  
Greedy Algorithm ◽  
Branch And Bound ◽  
Upper Bound ◽  
Optimization Problem ◽  
Approximation Factor ◽  
Real World Application ◽  
Efficiency Of Algorithms ◽  
Knapsack Constraint ◽  
Submodular Maximization

Monotone submodular maximization with a knapsack constraint is NP-hard. Various approximation algorithms have been devised to address this optimization problem. In this paper, we revisit the widely known modified greedy algorithm. First, we show that this algorithm can achieve an approximation factor of 0.405, which significantly improves the known factors of 0.357 given by Wolsey and (1-1/e)/2\approx 0.316 given by Khuller et al. More importantly, our analysis closes a gap in Khuller et al.'s proof for the extensively mentioned approximation factor of (1-1/\sqrte )\approx 0.393 in the literature to clarify a long-standing misconception on this issue. Second, we enhance the modified greedy algorithm to derive a data-dependent upper bound on the optimum. We empirically demonstrate the tightness of our upper bound with a real-world application. The bound enables us to obtain a data-dependent ratio typically much higher than 0.405 between the solution value of the modified greedy algorithm and the optimum. It can also be used to significantly improve the efficiency of algorithms such as branch and bound.

Streaming algorithms for robust submodular maximization

2021 ◽  
Vol 290 ◽  
pp. 112-122
Author(s):  
Ruiqi Yang ◽  
Dachuan Xu ◽  
Yukun Cheng ◽  
Yishui Wang ◽  
Dongmei Zhang
Keyword(s):  
Streaming Algorithms ◽  
Submodular Maximization

A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint

2020 ◽  
Vol 163 ◽  
pp. 106010
Author(s):  
Georgios Amanatidis ◽  
Georgios Birmpas ◽  
Evangelos Markakis
Keyword(s):  
Deterministic Algorithm ◽  
Knapsack Constraint ◽  
Submodular Maximization

Streaming Algorithms for Maximizing Non-submodular Functions on the Integer Lattice

2021 ◽  
pp. 3-14
Author(s):  
Bin Liu ◽  
Zihan Chen ◽  
Huijuan Wang ◽  
Weili Wu
Keyword(s):  
Integer Lattice ◽  
Submodular Functions ◽  
Streaming Algorithms

Streaming Algorithms for Budgeted k-Submodular Maximization Problem

2021 ◽  
pp. 27-38
Author(s):  
Canh V. Pham ◽  
Quang C. Vu ◽  
Dung K. T. Ha ◽  
Tai T. Nguyen
Keyword(s):  
Maximization Problem ◽  
Streaming Algorithms ◽  
Submodular Maximization

Monotone submodular maximization over the bounded integer lattice with cardinality constraints

2019 ◽  
Vol 11 (06) ◽  
pp. 1950075
Author(s):  
Lei Lai ◽  
Qiufen Ni ◽  
Changhong Lu ◽  
Chuanhe Huang ◽  
Weili Wu
Keyword(s):  
Approximation Algorithm ◽  
Greedy Algorithm ◽  
Deterministic Algorithm ◽  
Submodular Function ◽  
Integer Lattice ◽  
Cardinality Constraint ◽  
Cardinality Constraints ◽  
Definition Of ◽  
Deterministic Formula ◽  
Submodular Maximization

We consider the problem of maximizing monotone submodular function over the bounded integer lattice with a cardinality constraint. Function [Formula: see text] is submodular over integer lattice if [Formula: see text], [Formula: see text], where ∨ and ∧ represent elementwise maximum and minimum, respectively. Let [Formula: see text], and [Formula: see text], we study the problem of maximizing submodular function [Formula: see text] with constraints [Formula: see text] and [Formula: see text]. A random greedy [Formula: see text]-approximation algorithm and a deterministic [Formula: see text]-approximation algorithm are proposed in this paper. Both algorithms work in value oracle model. In the random greedy algorithm, we assume the monotone submodular function satisfies diminishing return property, which is not an equivalent definition of submodularity on integer lattice. Additionally, our random greedy algorithm makes [Formula: see text] value oracle queries and deterministic algorithm makes [Formula: see text] value oracle queries.

Sign in / Sign up

Export Citation Format

Share Document