Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Branch and Cut for Finding Optimal Steiner Trees in the Plane
Speaker:Ernst Althaus
coming from:
Speakers Bio:
Event Type:SIG Meeting
Visibility:D1, D2
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Friday, 9 April 99
Time:11:00
Duration:60 Minutes
Location:Saarbr├╝cken
Building:MPI
Room:007
Abstract
I present exact algorithms for the Euclidean and rectilinear Steiner

tree problems in the plane. These algorithms, which are based on the
generation and concatenation of full Steiner trees, are much more
efficient than other approaches and allow exact solution of problem
instances with more than 2000 terminals.

Contact
Name(s):Zeev Nutov
Phone:124
EMail:--email address not disclosed on the web
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):