## Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems (1995)

### Cached

### Download Links

- [ftp.cs.princeton.edu]
- [theory.lcs.mit.edu]
- [people.csail.mit.edu]
- [theory.cs.bonn.edu]
- [theory.cs.uni-bonn.de]
- [cs.uni-bonn.de]
- [www.cs.princeton.edu]
- DBLP

### Other Repositories/Bibliography

by
Sanjeev Arora
,
David Karger
,
Marek Karpinski

Citations: | 173 - 27 self |