Submodularity and randomized rounding techniques for optimal experimental design
type: Item
instance of: scholarly article
zbMATH Open document ID: 1237.93057
author: Mustapha Bouhtou
author: Stéphane Gaubert
author: Guillaume Sagnol
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 93B51
Mathematics Subject Classification ID: 65Y99
zbMATH DE Number: 6033984
zbMATH Keywords: optimal design of experiments
zbMATH Keywords: Kiefer's \(p\)-criterion
zbMATH Keywords: \(D\)-optimality
zbMATH Keywords: polynomial-time approximability
zbMATH Keywords: discrete optimization
describes a project that uses: NetQuest
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.086
OpenAlex ID: W2072277757
cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee
cites work: Sequences converging to D-optimal designs of experiments
cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
cites work: Optimal design: Variation in structure and performance under change of criterion
cites work: Q4633865
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: On linear regression designs which maximize information
cites work: Q4849481
cites work: D-optimal design of a monitoring network for parameter estimation of distributed systems
DOI: 10.1016/J.ENDM.2010.05.086
title: Submodularity and randomized rounding techniques for optimal experimental design
description: scientific article; zbMATH DE number 6033984