Log In Sign Up

Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint

by   Lan N. Nguyen, et al.

In this work, we study the problem of monotone non-submodular maximization with partition matroid constraint. Although a generalization of this problem has been studied in literature, our work focuses on leveraging properties of partition matroid constraint to (1) propose algorithms with theoretical bound and efficient query complexity; and (2) provide better analysis on theoretical performance guarantee of some existing techniques. We further investigate those algorithms' performance in two applications: Boosting Influence Spread and Video Summarization. Experiments show our algorithms return comparative results to the state-of-the-art algorithms while taking much fewer queries.


page 1

page 2

page 3

page 4


A Note on Monotone Submodular Maximization with Cardinality Constraint

We show that for the cardinality constrained monotone submodular maximiz...

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

In this paper we consider parallelization for applications whose objecti...

Efficient Algorithms for Searching the Minimum Information Partition in Integrated Information Theory

The ability to integrate information in the brain is considered to be an...

On the Complexity of Dynamic Submodular Maximization

We study dynamic algorithms for the problem of maximizing a monotone sub...

Efficient Multiple Constraint Acquisition

Constraint acquisition systems such as QuAcq and MultiAcq can assist non...

Sample Greedy Based Task Allocation for Multiple Robot Systems

This paper addresses the task allocation problem for multi-robot systems...

Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint

We consider fast algorithms for monotone submodular maximization subject...