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.- Sort by
- Weight
- Alphabetically
Polynomial time approximation schemes for dense instances of script N ℘-hard problems
Sanjeev Arora, David Karger, Marek Karpinski
Research output: Contribution to journal › Article › peer-review
142
Scopus
citations