Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Greedy Maximal Scheduling in Wireless Networks   In this paper we consider greedy scheduling algorithms in wireless networks,
i.e., the schedules are computed by adding links greedily based on some
priority vector. Two special cases are considered: 1) Longest Queue First (LQF)
scheduling, where the priorities are computed using queue lengths, and 2)
Static Priority (SP) scheduling, where the priorities are pre-assigned. We
first propose a closed-form lower bound stability region for LQF scheduling,
and discuss the tightness result in some scenarios. We then propose an lower
bound stability region for SP scheduling with multiple priority vectors, as
well as a heuristic priority assignment algorithm, which is related to the
well-known Expectation-Maximization (EM) algorithm. The performance gain of the
proposed heuristic algorithm is finally confirmed by simulations.

31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
15
The categories of this paper are: nucl-ex
10
The categories of this paper are: q-bio
9
The categories of this paper are: nlin
11
The categories of this paper are: hep-lat
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys