Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion
  Guarantees   We introduce and analyze two parameter-free linear-memory tree search
algorithms. Under mild assumptions we prove our algorithms are guaranteed to
perform only a logarithmic factor more node expansions than A* when the search
space is a tree. Previously, the best guarantee for a linear-memory algorithm
under similar assumptions was achieved by IDA*, which in the worst case expands
quadratically more nodes than in its last iteration. Empirical results support
the theory and demonstrate the practicality and robustness of our algorithms.
Furthermore, they are fast and easy to implement.

9
The categories of this paper are: nlin
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat
7
The categories of this paper are: hep-th
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
18
The categories of this paper are: econ
33
The categories of this paper are: plasm-ph
0
The categories of this paper are: hep-ph
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org