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, July 14, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Shankar Ram Lakshminarayanan

Approximation algorithm for Maximum 3-Cycle cover problem

In the maximum 3-cycle cover problem, given an edge weighted complete directed graph we ask for a collection of node-disjoint cycles each of length at least three whose weight is maximum among all such collections. I present a 3/4-approximation algorithm for the problem. This result is obtained via a new decomposition technique for the fractional solution of an LP formulation of the problem.

(Joint work with Markus Bläser and Maxim Sviridenko, IBM TJ Watson Research Center)

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