Efficient Submodular Function Maximization under Linear Packing Constraints
From MaRDI portal
Publication:2843232
DOI10.1007/978-3-642-31594-7_4zbMath1272.90063arXiv1007.3604OpenAlexW1930571140MaRDI QIDQ2843232
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.3604
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Costly circuits, submodular schedules and approximate Carathéodory theorems, Improved deterministic algorithms for non-monotone submodular maximization, Unnamed Item, Parallelized maximization of nonsubmodular function subject to a cardinality constraint, Algorithms for influence maximization in socio-physical networks