Campus Event Calendar
Event Entry
What and Who
Approximation Algorithms
Zeev Nutov
Max-Planck-Institut für Informatik - AG 1
AG1 Advanced Mini-Course
AG 1, AG 2
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 1 February 2000
13:30
90 Minutes
MPI
024
Saarbrücken
Abstract
I will review some discrete optimization problems, and some
concepts from the theory of Approximation algorithms.
Simple approximation algorithms for the following problems will be presented:
minimum 0/1 bin-packing, minimum makespan, minimum vertex cover,
metric cost TSP, minimum cost Steiner tree.
In subsequent talks, I will consider more advanced algorithms.
Contact
Zeev Nutov
--email hidden
passcode not visible
logged in users only