MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Linear time 2-approximation for weighted matching; Stoer-Wagner Mincut

R. Fleischer; K. Mehlhorn
MPI
SIG Meeting: Approx+Online
AG 1, AG 2  
AG Audience
English

Date, Time and Location

Friday, 26 March 99
11:00
-- Not specified --
MPI
007
Saarbrücken

Abstract

Rudolf will first speak about a new 2-approximation weighted

matching algorithm by R. Preis (STACS'99).
Then Kurt will present the Stoer-Wagner algorithm for computing minimum cuts in
undirected networks (LEDAbook, chapter on graph algorithms, section
mincut). He will also show how to compute a correctness certificate
for the algorithm (http://www.mpi-sb.mpg.de/~mehlhorn/ftp/mincut.ps).

Contact

Rudolf Fleischer
9325-119
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

approximation algorithm, weighted matching, min cut