human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Minimum cost source location problem with local 3-vertex-connectivity requirements"
  Abstract: Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v e V has a demand d(ν) e Z+ and a cost c(ν) e R+, where Z+ and R+ denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G asks to find a set S of vertices minimizing ΣνeS c(ν) such that there are at least d(ν) pairwise vertex-disjoint paths from S to ν for each vertex ν e V - S. It is known that if there exists a vertex ν e V with d(ν) ≥ 4, then the problem is NP-hard even in the case where every vertex has a uniform cost. In this paper, we show that the problem can be solved in O(|V|4(log|V|)2) time if d(ν) ≤ 3 holds for each vertex v e V.

Connected through hyperedge HE-1 (induced by source paper "Minimum cost source location problems with flow requirements"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics