Publication Details
Title: Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
Author: M. Karpinski
Group: ICSI Technical Reports
Date: May 1997
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1997/tr-97-022.pdf
Overview:
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.
Bibliographic Information:
ICSI Technical Report TR-97-022
Bibliographic Reference:
M. Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. ICSI Technical Report TR-97-022, May 1997
Author: M. Karpinski
Group: ICSI Technical Reports
Date: May 1997
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1997/tr-97-022.pdf
Overview:
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.
Bibliographic Information:
ICSI Technical Report TR-97-022
Bibliographic Reference:
M. Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. ICSI Technical Report TR-97-022, May 1997