Q4558139
type: Item
instance of: scholarly article
zbMATH Open document ID: 1437.68200
author: Abhimanyu Das
author: David Kempe
publication date: 2018-11-21T00:00:00Z
full work available at URL: 16-534.html
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 62J05
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 6982294
describes a project that uses: l1_ls
describes a project that uses: foba
MaRDI profile type: MaRDI publication profile
cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
cites work: Decoding by Linear Programming
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes
cites work: Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
cites work: Q3549682
cites work: Restricted strong convexity implies weak submodularity
cites work: Q4471300
cites work: Q5452361
cites work: Q4806224
cites work: Sparse Approximate Solutions to Linear Systems
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: Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
cites work: Q4864293
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
cites work: Just relax: convex programming methods for identifying sparse signals in noise
cites work: Q3549686
cites work: Q2999661
cites work: An analysis of the greedy algorithm for the submodular set covering problem
cites work: On the consistency of feature selection using greedy least squares regression
cites work: Q3174050
description: scientific article; zbMATH DE number 6982294