License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2020.3
URN: urn:nbn:de:0030-drops-132440
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13244/
Lee, Yin Tat
Convex Optimization and Dynamic Data Structure (Invited Talk)
Abstract
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.
BibTeX - Entry
@InProceedings{lee:LIPIcs:2020:13244,
author = {Yin Tat Lee},
title = {{Convex Optimization and Dynamic Data Structure (Invited Talk)}},
booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-174-0},
ISSN = {1868-8969},
year = {2020},
volume = {182},
editor = {Nitin Saxena and Sunil Simon},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13244},
URN = {urn:nbn:de:0030-drops-132440},
doi = {10.4230/LIPIcs.FSTTCS.2020.3},
annote = {Keywords: Convex Optimization, Dynamic Data Structure}
}
Keywords: |
|
Convex Optimization, Dynamic Data Structure |
Collection: |
|
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
04.12.2020 |