文章基本信息

标题：Approximately Good and Modern Matchings (Invited Talk)
本地全文：下载
作者：Ola Svensson
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：132
页码：1-1
DOI：10.4230/LIPIcs.ICALP.2019.3
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：The matching problem is one of our favorite benchmark problems. Work on it has contributed to the development of many core concepts of computer science, including the equation of efficiency with polynomial time computation in the groundbreaking work by Edmonds in 1965. However, half a century later, we still do not have full understanding of the complexity of the matching problem in several models of computation such as parallel, online, and streaming algorithms. In this talk we survey some of the major challenges and report some recent progress.
关键词：Algorithms; Matchings; Computational Complexity