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, September 01, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Dominik Scheder (Univ. of Colorado at Boulder)

Finding highly connected subgraphs of low weight

The problem of finding the minimum weight k-edge connected spanning subgraph of a mixed graph is NP-hard for every k >= 1, and, for k >= 2, the best approximation ratio known so far is 4. We analyze several approaches to the general k-ECSS problem of mixed graphs.

For the special case in which undirected edges have no higher weights than directed edges, we achieve a factor 3.75 approximation.

Further, we give several examples on which the analyzed algorithms perform poorly.

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

Previous talks by year:   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