Composable core-sets for determinant maximization problems via spectral spanners
We study a generalization of classical combinatorial graph spanners to the spectral setting. Given a set of vectors V ⊆ ℝd, we say a set U ⊆ V is an α-spectral kspanner, for k ≤ d, if for all v ∈ V there is a probability distribution µv supported on U such that vv ≼k α· Eu∼µvuu, where for two matric...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery,
2021-01-13T18:33:05Z.
|
| Subjects: | |
| Online Access: | Get fulltext |