MPI-INF Logo
Campus Event Calendar

Event Entry

What and Who

Steiner Trees and Integer Programming

T. Polzin, S.V. Daneshmand
Universität Mannheim
Talk
AG 1, AG 2  
AG Audience
English

Date, Time and Location

Thursday, 16 March 2000
13:30
90 Minutes
MPI
024
Saarbrücken

Abstract

Presentation of their two papers:

- A Comparison of Steiner Tree Relaxations
- Improved Algorithms for the Steiner Problem in Networks

Contact

Ernst Althaus
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Steiner Trees, Integer Programming