Publisher
Cambridge University Press
Reference256 articles.
1. Madry, Aleksander . 2013. Navigating central path with electrical flows: from flows to matchings, and back. Pages 253–262 of: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, October 26–29, Berkeley, CA.
2. The Matching Polytope has Exponential Extension Complexity
3. A polynomial algorithm for linear programming;Khachiyan;Doklady Akademii Nauk SSSR,1979
4. Cohen, Michael B. , Madry, Aleksander , Tsipras, Dimitris , and Vladu, Adrian . 2017. Matrix scaling and balancing via box constrained newton’s method and interior point methods. Pages 902–913 of: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, October 15–17, Berkeley, CA.
5. Celis, L. Elisa , Keswani, Vijay , and Vishnoi, Nisheeth K. 2020. Data preprocessing to mitigate bias: a maximum entropy based approach. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, July 13–18, 2020, Virtual Event. Proceedings of Machine Learning Research 119. PMLR 2020.