Steiner tree packing

By

Professor Lap-chi Lau

Department of Computer Science and Engineering The Chinese University of Hong Kong

Date: Nov 7, 2007

Time: 3:30pm - 4:30 pm

Venue: ERB 1009

Abstract :

Showing an approximate min-max theorem for Steiner tree packing, and its connection to a network multicasting problem.