AI Chat AI Image Generator AI Video Text to Speech

A Note on Monotone Submodular Maximization with Cardinality Constraint

06/16/2020
∙
by   Wenxin Li, et al.
∙
0
∙

We show that for the cardinality constrained monotone submodular maximization problem, there exists a (1-1/e-ε)-approximate deterministic algorithm with linear query complexity, which performs O(n/ε) queries in total.

READ FULL TEXT

page 1

page 2

page 3

Related Research

research
∙ 11/05/2021

On the Complexity of Dynamic Submodular Maximization

We study dynamic algorithms for the problem of maximizing a monotone sub...
0 Xi Chen, et al. ∙
research
∙ 04/22/2018

Towards Practical Constrained Monotone Submodular Maximization

We design new algorithms for maximizing a monotone non-negative submodul...
0 Wenxin Li, et al. ∙
research
∙ 02/21/2020

A polynomial lower bound on adaptive complexity of submodular maximization

In large-data applications, it is desirable to design algorithms with a ...
0 Wenzheng Li, et al. ∙
research
∙ 03/15/2018

Altitude Terrain Guarding and Guarding Uni-Monotone Polygons

We show that the problem of guarding an x-monotone terrain from an altit...
0 Stephan Friedrichs, et al. ∙
research
∙ 10/08/2020

Sensitivity Analysis of Submodular Function Maximization

We study the recently introduced idea of worst-case sensitivity for mono...
0 Conor McMeel, et al. ∙
research
∙ 05/13/2019

An improved algorithm for the submodular secretary problem with a cardinality constraint

We study the submodular secretary problem with a cardinality constraint....
0 Kaito Fujii, et al. ∙
research
∙ 07/12/2018

Algorithmic Meta-Theorems for Monotone Submodular Maximization

We consider a monotone submodular maximization problem whose constraint ...
0 Masakazu Ishihata, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal