
The Center for Algorithm and Optimization @ POSTECH

November 18, 2025 @ 6:00 PM – 8:00 PM
2025/26 eat & LEARN Seminar Series (1)
Video
Abstract
Many optimization problems are known to be NP-hard, making it difficult to obtain exact solutions efficiently. Approximation algorithms provide a practical alternative, and their performance is typically evaluated using the worst-case performance ratio. In this presentation, we explore how optimization can be leveraged to derive and analyze the worst-case performance ratios of approximation algorithms. Several illustrative examples are presented to demonstrate these approaches.
Photos from seminar


