Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
From MaRDI portal
Cites work
- A Tale of Santa Claus, Hypergraphs and Matroids
- An introduction to matrix concentration inequalities
- Approximate positive correlated distributions and approximation algorithms for D-optimal design
- Determinant maximization via matroid intersection algorithms
- Faster subset selection for matrices and applications
- scientific article; zbMATH DE number 5485443 (Why is no real title available?)
- scientific article; zbMATH DE number 5764883 (Why is no real title available?)
- scientific article; zbMATH DE number 7788403 (Why is no real title available?)
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids
- Maximizing determinants under partition constraints
- Near-optimal discrete optimization for experimental design: a regret minimization approach
- On allocating goods to maximize fairness
- On largest volume simplices and sub-determinants
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Optimal Design of Experiments
- Pipage rounding, pessimistic estimators and matrix concentration
- Proportional volume sampling and approximation algorithms for \(A\)-optimal design
- Randomized rounding for the largest simplex problem
- Santa claus meets hypergraph matchings
- The Kadison-Singer problem in discrepancy theory.
- The Santa Claus problem
- Twice-Ramanujan sparsifiers
This page was built for publication: Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988281)
