Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2001 Copyright 2001 Universität Bonn, Institut für Informatik, Abt. V
8969

18.09.2001

RAND-APX-Workshop on Approximation Intractability joint with the Workshop Design and Analysis of Randomized and Approximation Algorithms, Dagstuhl, June 3 - 8, 2001
Martin Dyer, Mark Jerrum and Marek Karpinski
[Download PostScript] [Download PDF]

The Workshop was concerned with the newest development in the design and analysis of randomized and approximation algorithms. The main focus of the workshop was on two specific topics: approximation algorithms for optimization problems, and approximation algorithms for measurement problems, and the various interactions between them. Here, new important paradigms have been discovered recently connecting probabilistic proof verification theory to the theory of approximate computation. Also, some new broadly applicable techniques have emerged recently for designing efficient approximation algorithms for a number of computationally hard optimization and measurement problems. This workshop has addressed the above topics and also fundamental insights into the new paradigms and design techniques. The workshop was organized jointly with the RAND-APX meeting on approximation algorithms and intractability and was partially supported by the IST grant 14036 (RAND-APX).

Last Change: 11/05/14 at 10:21:55
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope