A note on maximizing a submodular set function subject to a knapsack constraint
type: Item
instance of: scholarly article
title: A note on maximizing a submodular set function subject to a knapsack constraint
zbMATH Open document ID: 1056.90124
DOI: 10.1016/S0167-6377(03)00062-2
published in: Operations Research Letters
publication date: 2004-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2077344
zbMATH Keywords: Submodular function
zbMATH Keywords: Approximation algorithm
author: Maxim Sviridenko
MaRDI profile type: Publication
cites work: A threshold of ln n for approximating set cover
cites work: The budgeted maximum coverage problem
cites work: An Exact Algorithm for Maximum Entropy Sampling
cites work: Constrained maximum-entropy sampling
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Approximate Algorithms for the 0/1 Knapsack Problem
cites work: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
full work available at URL: s0167-6377(03)00062-2
OpenAlex ID: W2033885045
description: scientific article; zbMATH DE number 2077344