This project is a continuation of the cooperation between the combinatorial optimization group in Graz and the Department of Applied Mathematics at the Academia Sinica in Beijing, China. This cooperation within the framework of the Agreement of Scientific and Technical Cooperation between Austria and China has been started in 1989. In the period from 1995-1997 the main aim is to continue and extend the investigations of Steiner tree problems started a few years ago. A special focus will be on approximation algorithms for Steiner tree problems, scheduling problems and various other classes of NP-hard discrete optimization problems. Another topic of joint interest is the design and analysis of efficient on-line algorithms for various packing and scheduling problems. not assigned GG: Abkommen über die Wissenschaftlich-Technische Zusammenarbeit zwischen der Republik Österreich und der Volksrepublik China
|Effective start/end date||1/01/95 → 31/12/97|
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.