Submodularity and Randomized rounding techniques for Optimal Experimental Design (Q2883636): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences converging to D-optimal designs of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal design: Variation in structure and performance under change of criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear regression designs which maximize information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: D-optimal design of a monitoring network for parameter estimation of distributed systems / rank
 
Normal rank

Latest revision as of 04:25, 5 July 2024

scientific article
Language Label Description Also known as
English
Submodularity and Randomized rounding techniques for Optimal Experimental Design
scientific article

    Statements

    Submodularity and Randomized rounding techniques for Optimal Experimental Design (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2012
    0 references
    optimal design of experiments
    0 references
    Kiefer's \(p\)-criterion
    0 references
    \(D\)-optimality
    0 references
    polynomial-time approximability
    0 references
    discrete optimization
    0 references

    Identifiers