Approximately Good and Modern Matchings (Invited Talk)

Author Ola Svensson

Thumbnail PDF


  • Filesize: 176 kB
  • 1 pages

Document Identifiers

Author Details

Ola Svensson
  • EPFL, Lausanne, Switzerland

Cite AsGet BibTex

Ola Svensson. Approximately Good and Modern Matchings (Invited Talk). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
  • Algorithms
  • Matchings
  • Computational Complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads