Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Better Algorithms for Online Bin Stretching via Computer Search   We present an algorithm for computing upper bounds for the Online Bin
Stretching Problem with a small number of bins and the resulting upper bounds
for 4, 5 and 6 bins. This both demonstrates the possibility of using computer
search for upper bounds on a fundamentally real-valued online problem and
improves upon the best bounds know so far, some of which have remained
unchanged since 2001.

35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
5
The categories of this paper are: gr-qc
14
The categories of this paper are: math-ph
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math
27
The categories of this paper are: comp-gas