Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints

16 December 2020

Papers citing "Pareto Optimization for Subset Selection with Dynamic Partition Matroid Constraints"

7 / 7 papers shown

Title
Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms A. Do Frank Neumann 48 9 0 23 Jun 2020
Pareto Optimization for Subset Selection with Dynamic Cost Constraints Vahid Roostapour Aneta Neumann Frank Neumann Tobias Friedrich 43 73 0 14 Nov 2018
Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments Vahid Roostapour M. Pourhassan Frank Neumann 48 26 0 22 Jun 2018
Maximizing Submodular or Monotone Approximately Submodular Functions by Multi-objective Evolutionary Algorithms Chao Qian Yang Yu K. Tang Xin Yao Zhi Zhou 46 50 0 20 Nov 2017
Guarantees for Greedy Maximization of Non-submodular Functions with Applications Yatao Bian J. M. Buhmann Andreas Krause Sebastian Tschiatschek 65 237 0 06 Mar 2017
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection Abhimanyu Das David Kempe 202 484 0 19 Feb 2011
Efficient Minimization of Decomposable Submodular Functions Peter Stobbe Andreas Krause 87 124 0 26 Oct 2010