Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization
From MaRDI portal
(Redirected from Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization)
Publication:5363100
Publication:5363100
DOI10.1137/1.9781611973730.77zbMath1372.68283arXiv1410.0773MaRDI QIDQ5363100
Niv Buchbinder, Moran Feldman, Roy Schwartz
Publication date: 5 October 2017
Published in: Mathematics of Operations Research, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.0773
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68W25: Approximation algorithms