University of Birmingham > Talks@bham > Lab Lunch > Algorithms and Complexity through the eyes of Vertex Cover

Algorithms and Complexity through the eyes of Vertex Cover

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

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.