In this paper, we provide the first deterministic algorithm that achieves $1/2$-approximation
for monotone submodular maximization subject to a knapsack constraint, while making a …

This paper focuses on opinion summarization for constructing subjective and concise
summaries representing essential opinions of online text reviews. As previous works rarely …

This paper studies the problem of maximizing a non-negative monotone k-submodular
function. A k-submodular function is a generalization of a submodular function, where the …

We consider the problem of maximizing a non-negative monotone submodular function
subject to a knapsack constraint, which is also known as the Budgeted Submodular …

We focus on maximizing a non-negative k-submodular function under a knapsack constraint.
As a generalization of submodular functions, ak-submodular function considers k distinct …

A k-submodular function takes k distinct, non-overlapping subsets of a ground set as input
and outputs a value. It is a generalization of the well-known submodular function, which is …

We focus on maximizing a non-negative k-submodular function under a knapsack constraint.
As a generalization of submodular functions, a k-submodular function considers k distinct …

Wireless sensor networks have many applications in real life. We are given m sensors and n
users on the plane. The coverage of each sensor s is a disc area, whose radius r (s) and …

In this paper, we study a novel multi-objective combinatorial optimization problem called
Submodular Maximization with Fair Representation (SMFR), which selects subsets of …

Submodular maximization has been a central topic in theoretical computer science and
combinatorial optimization over the last decades. Plenty of well-performed approximation …