human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "near optimal coflow scheduling in networks"):
  Abstract: The coflow scheduling problem has emerged as a popular abstraction in the last few years to study data communication problems within a data center[6]. In this basic framework, each coflow has a set of communication demands and the goal is to schedule many coflows in a manner that minimizes the total weighted completion time. A coflow is said to complete when all its communication needs are met. This problem has been extremely well studied for the case of complete bipartite graphs that model a data center with full bisection bandwidth and several approximation algorithms and effective heuristics have been proposed recently[1,2,29]. In this work, we study a slightly different model of coflow scheduling in general graphs (to capture traffic between data centers [15,29]) and develop practical and efficient approximation algorithms for it. Our main result is a randomized 2 approximation algorithm for the single path and free path model, significantly improving prior work. In addition, we demonstrate via extensive experiments that the algorithm is practical, easy to implement and performs well in practice.

Includes members:
  Member "terra scalable cross layer gda optimizations":
    also connected through other hyperedges:
      (none)
  Member "constant factor approximation algorithm for weighted flow time on a single machine in pseudo polynomial time":
    also connected through other hyperedges:
      (none)
  Member "a polynomial time constant approximation for minimizing total weighted flow time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometry of scheduling on multiple machines")
  Member "stochastic non preemptive co flow scheduling with time indexed relaxation":
    also connected through other hyperedges:
      (none)
  Member "an improved bound for minimizing the total weighted completion time of coflows in datacenters":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimization of weighted completion times in path based coflow scheduling")
  Member "select and permute an improved online framework for scheduling to minimize weighted completion time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a tight approximation for co flow scheduling for minimizing total weighted completion time")
  Member "asymptotically optimal approximation algorithms for coflow scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "minimization of weighted completion times in path based coflow scheduling")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DC(Distributed, Parallel, and Cluster Computing)