[Коллоквиум]: Beyond Worst Case Analysis of Graph Partitioning Algorithms

549 views · Published 25 May 2015 · 1:28:16 · Indexed 12 November 2026

Channel: ФКН ВШЭ · 2015 · Education

Watch on YouTube

Speaker - Konstantin Makarychev, Microsoft Research

Many combinatorial optimization problems are much simpler in practice than in the worst-case. One of the challenges in the area of approximation algorithms is to explain this phenomenon and to design algorithms that work well in real-life. In this talk, I will first discuss different ways of modelling “real-life” instances. Then, I will present a new semi-random semi-adversarial model for graph partitioning problems, a planted model with permutation-invariant random edges (PIE). This model is much more general than stochastic models considered previously. Finally, I will describe a “constant factor” approximation algorithm for finding the minimum balanced cut in graphs from this model.

More from this channel