Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotone
  Submodular Maximization   Unconstrained submodular maximization captures many NP-hard combinatorial
optimization problems, including Max-Cut, Max-Di-Cut, and variants of facility
location problems. Recently, Buchbinder et al. presented a surprisingly simple
linear time randomized greedy-like online algorithm that achieves a constant
approximation ratio of 1/2, matching optimally the hardness result of Feige et
al.. Motivated by the algorithm of Buchbinder et al., we introduce a precise
algorithmic model called double-sided myopic algorithms. We show that while the
algorithm of Buchbinder et al. can be realized as a randomized online
double-sided myopic algorithm, no such deterministic algorithm, even with
adaptive ordering, can achieve the same approximation ratio. With respect to
the Max-Di-Cut problem, we relate the Buchbinder et al. algorithm and our
myopic framework to the online algorithm and inapproximation of Bar-Noy and
Lampis.

37
The categories of this paper are: supr-con
9
The categories of this paper are: nlin
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
16
The categories of this paper are: stat
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
6
The categories of this paper are: astro-ph
36
The categories of this paper are: cmp-lg
30
The categories of this paper are: q-alg
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph