A generalization of permanent inequalities and applications in counting and optimization
DOI10.1145/3055399.3055469zbMath1370.26031arXiv1702.02937MaRDI QIDQ4977987
Shayan Oveis Gharan, Nima Anari
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.02937
permanent; saddle point problem; determinantal point process; stable polynomial; volume maximization
15A15: Determinants, permanents, traces, other special matrix functions
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
47A13: Several-variable operator theory (spectral, Fredholm, etc.)
26D05: Inequalities for trigonometric functions and polynomials
