Journal: Electronic Colloquium on Computational Complexity (ECCC)

Volume 4, Issue 24

0 -- 0Marek Karpinski. Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems