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

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

Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
Marek Karpinski
[Download PostScript] [Download PDF]

We overview recent results on the existence of polynomial time approximation schemes for some dense instances of NP-hard optimization problems. We indicate further some inherent limits for existence of such schemes for some other dense instances of the optimization problems.

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

Powered by Zope