
University of Bonn > Department of Computer Science > Chair V  
CSReports 1997  Copyright 1997 University of Bonn, Department of Computer Science, Abt. V  
85172

Polynomial Time Approximation Schemes for Some Dense Instances of NPHard 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 NPhard 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
Deutsch 
University of Bonn > Department of Computer Science > Chair V 