Campus Event Calendar: Zeev Nutov (02/03/2000 in MPI/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

New for: D1, D2

What and Who

Mini-Course on Approximation Algorithms

Zeev Nutov

Max-Planck-Institut für Informatik - AG 1

AG1 Advanced Mini-Course

AG 1, AG 2

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Thursday, 3 February 2000

13:30

90 Minutes

MPI

024

Saarbrücken

Abstract

Algorithms to be considered:

* Christofides' heuristic for the metric traveling salesman problem.
* a 2-approximation algorithm for the Steiner tree problem.
* Pseudo-polynomial algorithm for the knapsack problem,
and a fully polynomial approximation scheme for knapsack.

Contact

Zeev Nutov

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Imprint / Impressum | Data Protection / Datenschutzhinweis