Department of Systems Engineering and Engineering Management,

                    The Chinese University of Hong Kong


Approximation Algorithms for Linear Programming

Advanced Optimization Lab,
MacMaster University

Date : December 14, 2005 (Wednesday)

Time : 11:00 a.m. - 12:00 p.m.

Venue : Room 612(FE Lab), William M.W. Mong Engineering Building

(Engineering Building Complex Phase 2), CUHK

In this talk, we briefly review algorithms for some structured linear
programming problems, which can find solutions with theoretical approximation
bounds in polynomial time. We also show some applications of these
approximation algorithms in communication networks, VLSI routing and wireless
communication. This is joint work with J. Chlebikova, K. Jansen, Q. Lu, M.
Saad, T. Terlaky, A. Vannelli and D. Ye.

Hu Zhang is currently a postdoc in the advanced optimization lab at McMaster
University sponsored by Prof. Tamas Terlaky. He got his first degree in
aerodynamics at Nanjing University of Aeronautics and Astronautics, and a
master degree in mathematics at Hong Kong University of Science and
Technology. He obtained his PhD degree in theoretical computer science at
University of Kiel, Germany. He is working on design, analysis and
implementation of approximation algorithms for mathematical programming and
combinatorial optimization problems, such as scheduling, VLSI design, digital


                       ***** ALL ARE WELCOME *****

Host : Prof. Shuzhong Zhang
Tel : 26098240
Email : zhang@se.cuhk.edu.hk

For more information please

refer to http://www.se.cuhk.edu.hk/~seg5810/