Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Dilemma First Search for Effortless Optimization of NP-Hard Problems   To tackle the exponentiality associated with NP-hard problems, two paradigms
have been proposed. First, Branch & Bound, like Dynamic Programming, achieve
efficient exact inference but requires extensive information and analysis about
the problem at hand. Second, meta-heuristics are easier to implement but
comparatively inefficient. As a result, a number of problems have been left
unoptimized and plain greedy solutions are used. We introduce a theoretical
framework and propose a powerful yet simple search method called Dilemma First
Search (DFS). DFS exploits the decision heuristic needed for the greedy
solution for further optimization. DFS is useful when it is hard to design
efficient exact inference. We evaluate DFS on two problems: First, the Knapsack
problem, for which efficient algorithms exist, serves as a toy example. Second,
Decision Tree inference, where state-of-the-art algorithms rely on the greedy
or randomness-based solutions. We further show that decision trees benefit from
optimizations that are performed in a fraction of the iterations required by a
random-based search.

28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
32
The categories of this paper are: atom-ph
2
The categories of this paper are: math
36
The categories of this paper are: cmp-lg
11
The categories of this paper are: hep-lat
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin
0
The categories of this paper are: hep-ph