MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Approximation algorithms reading group

Julian Mestre
Max-Planck-Institut für Informatik - D1
Lecture
AG 1  
AG Audience
English

Date, Time and Location

Thursday, 17 January 2008
15:00
-- Not specified --
E1 4
Rotunda 3rd floor
Saarbrücken

Abstract

The concept of Lagrangian relaxation is closely related to LP duality

and has been successfully applied to approximation algorithms for
many problems. In this talk I'll review some of positive and negative
results regarding Lagrangian relaxation when applied to Partial
Covering problems.

Contact

Khaled Elbassioni
--email hidden
passcode not visible
logged in users only

Khaled Elbassioni, 01/14/2008 21:58 -- Created document.