## Structure in Approximation Classes (1996)

### Cached

### Download Links

- [ftp.nada.kth.se]
- [www.cs.columbia.edu]
- [www.cse.buffalo.edu]
- DBLP

### Other Repositories/Bibliography

by
P. Crescenzi
,
V. Kann
,
R. Silvestri
,
L. Trevisan

Citations: | 74 - 14 self |

### BibTeX

@MISC{Crescenzi96structurein,

author = {P. Crescenzi and V. Kann and R. Silvestri and L. Trevisan},

title = {Structure in Approximation Classes},

year = {1996}

}

### OpenURL

### Abstract

this paper we obtain new results on the structure of several computationally-defined approximation classes. In particular, after defining a new approximation preserving reducibility to be used for as many approximation classes as possible, we give the first examples of natural NPO-complete problems and the first examples of natural APX-intermediate problems. Moreover, we state new connections between the approximability properties and the query complexity of NPO problems.