Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems

Marek Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. Algorithmica, 30(3):386-397, 2001. [doi]

Abstract

Abstract is missing.