Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, June 03, 2021, 12:15 pm

Duration: 30 minutes

Location: Zoom: conference room

Speaker: Michal Dory

Distributed Weighted Min Cut in Nearly Optimal Time

In a seminal work, Karger showed that the minimum cut problem reduces to a problem called the minimum 2-respecting cut problem, in which the goal is to find the minimum cut that has at most 2 edges in a certain spanning tree of the graph. I will discuss new structural observations on the minimum 2-respecting cut problem, that lead to a near optimal distributed min cut algorithm. Based on a joint work with Yuval Efron, Sagnik Mukhopadhyay and Danupon Nanongkai, to appear in STOC 2021.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login