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.ICALP.2019.3
URN: urn:nbn:de:0030-drops-105797
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10579/
Svensson, Ola
Approximately Good and Modern Matchings (Invited Talk)
Abstract
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.
BibTeX - Entry
@InProceedings{svensson:LIPIcs:2019:10579,
author = {Ola Svensson},
title = {{Approximately Good and Modern Matchings (Invited Talk)}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Christel Baier and Ioannis Chatzigiannakis and Paola Flocchini and Stefano Leonardi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10579},
URN = {urn:nbn:de:0030-drops-105797},
doi = {10.4230/LIPIcs.ICALP.2019.3},
annote = {Keywords: Algorithms, Matchings, Computational Complexity}
}
|
Keywords: |
|
Algorithms, Matchings, Computational Complexity |
|
Collection: |
|
46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
04.07.2019 |
