Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Resource Augmentation   This chapter introduces resource augmentation, in which the performance of an
algorithm is compared to the best-possible solution that is handicapped by less
resources. We consider three case studies: online paging, with cache size as
the resource; selfish routing, with capacity as the resource; and scheduling,
with processor speed as the resource. Resource augmentation bounds also imply
"loosely competitive" bounds, which show that an algorithm's performance is
near-optimal for most resource levels.

2
The categories of this paper are: math
19
The categories of this paper are: eess
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
5
The categories of this paper are: gr-qc
28
The categories of this paper are: alg-geom
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
33
The categories of this paper are: plasm-ph
13
The categories of this paper are: quant-ph
10
The categories of this paper are: q-bio