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: "Server scheduling in the L p norm: a rising tide lifts all boat"
  Abstract: Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair to individual jobs. The standard method for balancing average QoS and fairness is optimize the  L p   metric,  1  . Thus we consider server scheduling strategies to optimize the  L p   norms of the standard QoS measures, flow and stretch. We first show that there is no  n o(1)  -competitive online algorithm for the  L p   norms of either flow or stretch. We then show that the standard clairvoyant algorithms for optimizing average QoS,  SJF  and  SRPT , are  O(1+e) -speed  O(1/e) -competitive for the  L p   norms of flow and stretch. And that the standard nonclairvoyant algorithm for optimizing average QoS,  SETF , is  O(1+e) -speed  O(1/e (2+2/p) ) -competitive for the  L p   norms of flow. These results argue that these standard algorithms will not starve jobs until the system is near peak capacity. In contrast, we show that the Round Robin, or Processor Sharing algorithm, which is sometimes adopted because of its seeming fairness properties, is not  O(1+e) -speed  n o(1)  -competitive for sufficiently small  e .

Connected through hyperedge HE-1 (induced by source paper "Minimizing weighted flow time"):
  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: Computer science