Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs

DOI10.1016/J.DAM.2012.07.016zbMath1262.90152arXiv1007.4152OpenAlexW2153329369MaRDI QIDQ1759885

Guillaume Sagnol

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4152

zbMATH Keywords

submodularitymatrix inequalitiesoptimal design of experimentsmaximum coverageKiefer's \(p\)-criterionpolynomial-time approximabilityrounding algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (4)

Computing efficient exact designs of experiments using integer quadratic programming ⋮ On greedy heuristics for computing D-efficient saturated subsets ⋮ Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback ⋮ Ascent with quadratic assistance for the construction of exact experimental designs

This page was built for publication: Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs