Generalized budgeted submodular set function maximization
type: Item
instance of: scholarly article
title: Generalized budgeted submodular set function maximization
author: Francesco Cellinese
author: Gianlorenzo D'Angelo
author: Gianpiero Monaco
author: Yllka Velaj
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/9613/
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433289
zbMATH Keywords: submodular set function
zbMATH Keywords: approximation algorithms
zbMATH Keywords: budgeted maximum coverage
MaRDI profile type: Publication
OpenAlex ID: W2886054122
cites work: Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections
cites work: A 6/5-approximation algorithm for the maximum 3-cover problem
cites work: Q5005131
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: The generalized maximum coverage problem
cites work: On the maximum betweenness improvement problem
cites work: Q5111292
cites work: Recommending links through influence maximization
cites work: A threshold of ln n for approximating set cover
cites work: Maximizing Non-monotone Submodular Functions
cites work: Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
cites work: Maximum bounded 3-dimensional matching is MAX SNP-complete
cites work: Q2941641
cites work: The budgeted maximum coverage problem
cites work: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: A note on maximizing a submodular set function subject to a knapsack constraint
cites work: Q4608613
cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes
cites work: A \(\frac{(k+3)}{2}\)-approximation algorithm for monotone submodular \(k\)-set packing and general \(k\)-exchange systems
DOI: 10.1016/J.IC.2021.104741
description: scientific article; zbMATH DE number 7433289