Comparing apples and oranges: query trade-off in submodular maximization

DOI10.1287/MOOR.2016.0809MaRDI QIDQ6829833zbMATH OpenFDO

Authors Niv Buchbinder, Moran Feldman, Roy Schwartz

Publication date 2 June 2017

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/MOOR.2016.0809

zbMATH Keywords

approximation algorithmmatroidsubmodular maximization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(5)

• Subquadratic submodular maximization with a general matroid constraint
• Separating coverage and submodular: maximization subject to a cardinality constraint
• A fast algorithm for submodular maximization with a matroid constraint
• Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
• From global to query-dependent: summarization of large hierarchical DAGs

This page was built for publication: Comparing apples and oranges: query trade-off in submodular maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829833)