Determinant Maximization via Matroid Intersection Algorithms-Reference-Cited by-同舟云学术

Determinant Maximization via Matroid Intersection Algorithms

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Brown Adam¹,Laddha Aditi²,Pittu Madhusudhan³,Singh Mohit⁴,Tetali Prasad⁵

Affiliation:

1. Georgia Institute of Technology,School of Mathematics,Atlanta,USA

2. Georgia Institute of Technology,College of Computing,Atlanta,USA

3. Carnegie Mellon University,School of Computer Science,Pittsburgh,USA

4. Georgia Institute of Technology,H. Milton Stewart School of Industrial and Systems Engineering,Atlanta,USA

5. Carnegie Mellon University,Mathematical Sciences,Pittsburgh,USA

Funder

Microsoft

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9996589/9996592/09996897.pdf?arnumber=9996897

Reference32 articles.

1. On largest volume simplices and sub-determinants

2. Randomized Rounding for the Largest Simplex Problem

3. Approximate positive correlated distributions and approximation algorithms for D-optimal design;singh;Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms,2018

4. Randomized Rounding for the Largest Simplex Problem

5. Interlacing families II: Mixed characteristic polynomials and the Kadison--Singer problem

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Algorithms for Maximizing the Minimum Eigenvalue in Fixed Dimension;Operations Research Letters;2024-09

2. Determinant Maximization via Matroid Intersection Algorithms;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10