Improved Lower Bounds for Submodular Function Minimization-Reference-Cited by-同舟云学术

Improved Lower Bounds for Submodular Function Minimization

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:

Chakrabarty Deeparnab¹,Graur Andrei²,Jiang Haotian³,Sidford Aaron⁴

Affiliation:

1. Dartmouth College,Department of Computer Science,Hanover,New Hampshire,USA

2. Stanford University,Department of Management Science & Engineering,Stanford,California,USA

3. University of Washington,Paul G. Allen School of Computer Science & Engineering,Seattle,Washington,USA

4. Stanford University,Department of Management Science & Engineering and Department of Computer Science,Stanford,California,USA

Publisher

IEEE

Link

Reference32 articles.

3. Minimizing convex functions with integral minimizers;baraniuk;Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),2021

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

1. Parallel Sampling via Counting;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Sparse Submodular Function Minimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Fast Algorithms via Dynamic-Oracle Matroids;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02