Polynomial time approximation schemes for dense instances of script N ℘-hard problems

Sanjeev Arora, David Karger, Marek Karpinski

Research output: Contribution to journalArticlepeer-review

148 Scopus citations

Fingerprint

Dive into the research topics of 'Polynomial time approximation schemes for dense instances of script N ℘-hard problems'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science