Algorithms and Complexity through the eyes of Vertex Cover (Part 2)

Add to your list(s) Download to your calendar using vCal

• Rajesh Chitnis (University of Birmingham)
• Thursday 07 November 2019, 12:00-13:00
• CS 217.

If you have a question about this talk, please contact Todd Waugh Ambridge.

Part 2 of last week's talk

Via the example of the Vertex Cover problem I will give an introduction to various algorithmic paradigms such as approximation algorithms, streaming algorithms, FPT algorithms, exact exponential algorithms, etc. and lower bound frameworks based on NP-completeness, communication complexity, Exponential Time Hypothesis (ETH), Unique Games Conjecture (UGC), etc. No background will be assumed.

This talk is part of the Lab Lunch series.

This talk is included in these lists:

• CS 217
• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Lab Lunch
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.