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

doi 10.1137/1.9781611975482.19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Deterministic Algorithms for Submodular Maximization Problems

2015English

Parallel Real-Time Optimization: Beyond Speedup

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
1999English

Subspace Selection via DR-Submodular Maximization on Lattices

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Running an HCI Experiment in Multiple Parallel Universes

2014English

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2002English

Whole-Page Optimization and Submodular Welfare Maximization With Online Bidders

ACM Transactions on Economics and Computation
StatisticsProbabilityMarketingEconomicsComputer ScienceComputational MathematicsEconometrics
2016English

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

SIAM Journal on Computing
MathematicsComputer Science
2014English

Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes

SIAM Journal on Computing
MathematicsComputer Science
2014English

Providing Performance Guarantees for Buffered Crossbar Switches Without Speedup

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Computer NetworksCommunications
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy