Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
Publication:5169688
DOI10.1287/moor.2013.0592zbMath1291.90205arXiv1101.2940OpenAlexW2109309418MaRDI QIDQ5169688
Ariel Kulik, Tami Tamir, Hadas Shachnai
Publication date: 11 July 2014
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.2940
generalized assignment problemrandomizationapproximation algorithmsknapsack constraintssubmodular maximizationmaximum coverage
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (29)
This page was built for publication: Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints