Media Summary: Speaker: Karen J. Morenz Korol, Department of Chemistry, University of Toronto Date: October 14th, 2022 Abstract: ... This talk was presented as part of the Quantum CMU 15-251: Great Ideas in Theoretical Computer Science Spring 2016 Lecture :
Approximation Algorithms For Bounded Degree - Detailed Analysis & Overview
Speaker: Karen J. Morenz Korol, Department of Chemistry, University of Toronto Date: October 14th, 2022 Abstract: ... This talk was presented as part of the Quantum CMU 15-251: Great Ideas in Theoretical Computer Science Spring 2016 Lecture : Author: Chandra Chekuri, Kent Quanrud and Manuel Torres. MIT 6.890 Algorithmic Lower Bounds: Fun with Hardness Proofs, Fall 2014 View the complete course: In this video, we discuss the vertex cover problem. In particular we show that Vertex Cover can be 2-approximated.
