v1v2 (latest)

Approximate Supermodularity Bounds for Experimental Design

4 November 2017

Alejandro Ribeiro

Papers citing "Approximate Supermodularity Bounds for Experimental Design"

3 / 3 papers shown

Title
Guarantees for Greedy Maximization of Non-submodular Functions with Applications Yatao Bian J. M. Buhmann Andreas Krause Sebastian Tschiatschek 81 237 0 06 Mar 2017
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection Abhimanyu Das David Kempe 211 484 0 19 Feb 2011
Computing Optimal Designs of multiresponse Experiments reduces to Second-Order Cone Programming G. Sagnol 90 67 0 30 Dec 2009