Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Complexity of Switching and FACTS Maximum-Potential-Flow Problems   This papers considers the problem of maximizing the load that can be served
by a power network. We use the commonly accepted Linear DC power network model
and consider wo configuration options: switching lines and using FACTS devices.
We present the first comprehensive complexity study of this optimization
problem. Our results show hat the problem is NP-complete and that there is no
fully polynomial-time approximation scheme. For switching, these results extend
to planar networks with a aximum-node degree of 3. Additionally, we demonstrate
that the optimization problems are still NP-hard if we restrict the network
structure to cacti with a maximum degree of 3.

20
The categories of this paper are: acc-phys
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
24
The categories of this paper are: dg-ga
22
The categories of this paper are: chao-dyn
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
31
The categories of this paper are: ao-sci
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio