Submodular maximization is a significant area of interest in combinatorial optimization, with numerous real-world applications. A research team led by Xiaoming SUN from the State Key Lab of Processors ...

The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine the maximum value of items you can place in your knapsack. The number of ...