Monotone Submodular Maximization Over a Matroid via Non-Oblivious Local Search

SIAM Journal on Computing - United States
doi 10.1137/130920277
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Subspace Selection via DR-Submodular Maximization on Lattices

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

SIAM Journal on Computing
MathematicsComputer Science
2014English

Deterministic Algorithms for Submodular Maximization Problems

2015English

Whole-Page Optimization and Submodular Welfare Maximization With Online Bidders

ACM Transactions on Economics and Computation
StatisticsProbabilityMarketingEconomicsComputer ScienceComputational MathematicsEconometrics
2016English

Balls Into Bins via Local Search

2013English

Lower Bounds for Oblivious Near-Neighbor Search

2020English

An Exponential Speedup in Parallel Running Time for Submodular Maximization Without Loss in Approximation

2019English

Oblivious Transfer and Quantum Non-Locality

2005English

Distributed Submodular Minimization and Motion Planning Over Discrete State Space

IEEE Transactions on Control of Network Systems
ControlSystems EngineeringSignal ProcessingComputer NetworksCommunicationsOptimization
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy