Maximizing determinants under partition constraints

DOI10.1145/2897518.2897649zbMath1377.90078OpenAlexW2410275234MaRDI QIDQ5361829

Aleksandar Nikolov, Mohit Singh

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2897518.2897649

zbMATH Keywords

approximation algorithmsdeterminantal point processeslogsubmodular optimizationmaximum subdeterminant

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (11)

Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes ⋮ Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design ⋮ A Local Search Framework for Experimental Design ⋮ Unnamed Item ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ A generalization of permanent inequalities and applications in counting and optimization ⋮ Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration ⋮ Approximation Algorithms for D-optimal Design ⋮ Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids ⋮ Nash Social Welfare, Matrix Permanent, and Stable Polynomials ⋮ Spectral Analysis of Matrix Scaling and Operator Scaling

This page was built for publication: Maximizing determinants under partition constraints