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: Tuesday, December 09, 2003, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Simone Croci

Approximate Local Search in Combinatorial Optimization

We will talk about the combinatorial optimization, in which a finite set of solutions is to be analyzed in order to find a globally optimal solution. A particular way to attack the problem consists in superimposing a neighborhood structure to the combinatorial optimization problem and in computing a special solution called local optimum, which fulfills the optimality criterion at least with respect to its neighborhood. The talk will focus on finding an approximately local optimum or epsilon local optimum. One of the main results states an epsilon local optimum can be computed in polynomial time for the class of problems known as PLS (polynomial local search).

Reference: J. Orlin, A. Punnen and A. Schulz, Approximate Local Search in Combinatorial Optimization. Working Paper, MIT Sloan School of Management, 2003. To appear in SODA 2004.

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