\documentstyle[12pt]{article}
\addtolength{\oddsidemargin}{-1cm}
\addtolength{\evensidemargin}{-1cm}
\addtolength{\textwidth}{2cm}
\addtolength{\textheight}{25cm}
\parindent=0pt
\parskip=1em
\pagestyle{empty}

\begin{document}
\vspace{-8cm}
\begin{center}
{\huge RAND-Seminar \\*[1,5cm]

Montag, 21. April 1997, 11 Uhr c.t.\\*[1,5cm]
Seminarraum 327\\*[2,5cm]

''On the Complexity of Dense Approximation Problems''}\\*[1,5cm]

{\Large J\"urgen Wirtgen, University of Bonn}
 
\end{center}
 
Abstract: 

In this talk we give a short introduction to the
theory of approximation algorithms. 
We describe technices for proving lower
and upper bounds for approximations.
{\it Dense approximation problems} will be discussed in detail.
A lot of problems which
are hard from the approximational point of view,
are easier to solve in the dense case.
We will give a brief  overview over some of these
problems.
%\\
%\\
% Joint work with
\end{document}





