2026-08-05T19:00:07Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13244 2024-03-06T10:51:55Z ddc:004 open_access

Convex Optimization and Dynamic Data Structure (Invited Talk) Lee, Yin Tat Convex Optimization Dynamic Data Structure In the last three years, there are many breakthroughs in optimization such as nearly quadratic time algorithms for bipartite matching, linear programming algorithms that are as fast as Ax = b. All of these algorithms are based on a careful combination of optimization techniques and dynamic data structures. In this talk, we will explain the framework underlying all the recent breakthroughs. Joint work with Jan van den Brand, Michael B. Cohen, Sally Dong, Haotian Jiang, Tarun Kathuria, Danupon Nanongkai, Swati Padmanabhan, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang, Sam Chiu-wai Wong, Guanghao Ye, Qiuyi Zhang. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yin Tat Lee 2020 Is Part Of LIPIcs, Volume 182, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2020.3 urn:nbn:de:0030-drops-132440 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2020.3 eng https://creativecommons.org/licenses/by/3.0/legalcode