********************************************************************
Seminar
Department of Systems Engineering and Engineering Management
The Chinese
------------------------------------------------------------------------------------------
|
|
|
Title |
: |
Stochastic |
|
|
|
Speaker |
: |
Prof. Abdel Lisser |
|
|
Department of Computer Science |
|
|
University of Paris Sud |
|
|
|
Date |
: |
July 20th, 2011 (Wednesday) |
|
|
|
Time |
: |
4:30 p.m. - 5:30 p.m. |
|
|
|
Venue |
: |
Room 513 |
|
|
William M.W. Mong Engineering
Building |
|
|
(Engineering Building Complex Phase 2) |
|
|
CUHK |
|
|
|
------------------------------------------------------------------------------------------
Abstract:
The maximum weight forest problem (MWFP) in a graph is
solved by the famous greedy algorithm due to |
-------------------------------------------------------------------------------------------
Biography:
After more than 10 years in France Telecom Research
center, A.Lisser joined the |
************************* ALL ARE WELCOME ************************
|
|
|
Host |
: |
Prof. Janny Leung |
Tel |
: |
(852) 2609-8238 |
Email |
: |
|
|
|
|
Enquiries |
: |
Prof. Nan Chen or Prof. Sean X. Zhou |
|
: |
Department of Systems Engineering and Engineering
Management |
|
|
CUHK |
Website |
: |
|
Email |
: |
|
|
|
|
********************************************************************