DeepAI
Log In Sign Up

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

04/29/2022
by   Lan N. Nguyen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/16/2020

A Note on Monotone Submodular Maximization with Cardinality Constraint

We show that for the cardinality constrained monotone submodular maximiz...
07/30/2018

Non-monotone Submodular Maximization in Exponentially Fewer Iterations

In this paper we consider parallelization for applications whose objecti...
12/19/2017

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...
11/05/2021

On the Complexity of Dynamic Submodular Maximization

We study dynamic algorithms for the problem of maximizing a monotone sub...
09/13/2021

Efficient Multiple Constraint Acquisition

Constraint acquisition systems such as QuAcq and MultiAcq can assist non...
01/10/2019

Sample Greedy Based Task Allocation for Multiple Robot Systems

This paper addresses the task allocation problem for multi-robot systems...
11/19/2018

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

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