Publication:5005131
From MaRDI portal
DOI10.4230/LIPIcs.MFCS.2018.31MaRDI QIDQ5005131
Gianpiero Monaco, Francesco Cellinese, Gianlorenzo D'Angelo, Yllka Velaj
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1808.03085
68Qxx: Theory of computing
Related Items
Pervasive domination, Generalized budgeted submodular set function maximization, The multi-budget maximum weighted coverage problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- The generalized maximum coverage problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- The budgeted maximum coverage problem
- Recommending links through influence maximization
- A 6/5-approximation algorithm for the maximum 3-cover problem
- Maximizing Non-monotone Submodular Functions
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- An analysis of approximations for maximizing submodular set functions—I
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
- Wavelength Management in WDM Rings to Maximize the Number of Connections
