scientific article; zbMATH DE number 5485514
From MaRDI portal
Publication:3549682
zbMATH Open1231.68283MaRDI QIDQ3549682FDOQ3549682
Authors: Abhimanyu Das, David Kempe 
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
Cited In (26)
- Improved deterministic algorithms for non-monotone submodular maximization
- Title not available (Why is that?)
- Algorithms for cardinality-constrained monotone DR-submodular maximization with low adaptivity and query complexity
- A note on the hardness of sparse approximation
- Replication or Exploration? Sequential Design for Stochastic Simulation Experiments
- Subset Selection in Sparse Matrices
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Optimal column subset selection for image classification by genetic algorithms
- Title not available (Why is that?)
- Sparse approximation based on a random overcomplete basis
- A graph-based decomposition method for convex quadratic optimization with indicators
- Data summarization beyond monotonicity: non-monotone two-stage submodular maximization
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- A polynomial case of the cardinality-constrained quadratic optimization problem
- Structured Robust Submodular Maximization: Offline and Online Algorithms
- Title not available (Why is that?)
- Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
- A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
- Maximum relevance minimum common redundancy feature selection for nonlinear data
- Sparse approximation over the cube
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint
- Scalable Algorithms for the Sparse Ridge Regression
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
- Group fairness in non-monotone submodular maximization
- Improved deterministic algorithms for non-monotone submodular maximization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549682)
