Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

SIAM Journal on Computing - United States
doi 10.1137/110839655
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

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

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

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution

2020English

Near-Optimal Approximate Discrete and Continuous Submodular Function Minimization

2020English

Relaxation Schemes for the Multicomponent Euler System

ESAIM: Mathematical Modelling and Numerical Analysis
Numerical AnalysisApplied MathematicsAnalysisSimulationModelingComputational Mathematics
2003English

Contention Resolution With Constant Throughput and Log-Logstar Channel Accesses

SIAM Journal on Computing
MathematicsComputer Science
2018English

A Doubly Nonnegative Relaxation for Modularity Density Maximization

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy