human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "scheduling to approximate minimization objectives on identical machines"
  Abstract: This paper considers scheduling on identical machines. The scheduling objective considered in this paper generalizes most scheduling minimization problems. In the problem, there are $n$ jobs and each job $j$ is associated with a monotonically increasing function $g_j$. The goal is to design a schedule that minimizes $\sum_{j \in [n]} g_{j}(C_j)$ where $C_j$ is the completion time of job $j$ in the schedule. An $O(1)$-approximation is known for the single machine case. On multiple machines, this paper shows that if the scheduler is required to be either non-migratory or non-preemptive then any algorithm has an unbounded approximation ratio. Using preemption and migration, this paper gives a $O(\log \log nP)$-approximation on multiple machines, the first result on multiple machines. These results imply the first non-trivial positive results for several special cases of the problem considered, such as throughput minimization and tardiness. #R##N#Natural linear programs known for the problem have a poor integrality gap. The results are obtained by strengthening a natural linear program for the problem with a set of covering inequalities we call job cover inequalities. This linear program is rounded to an integral solution by building on quasi-uniform sampling and rounding techniques.

Connected through hyperedge HE-1 (induced by source paper "a water filling primal dual algorithm for approximating non linear covering problems"):
  with members:
    - "geometry of scheduling on multiple machines"
    - "constant approximation algorithm for non uniform capacitated multi item lot sizing via strong covering inequalities"
    - "small extended formulation for knapsack cover inequalities from monotone circuits"
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "lp based algorithms for capacitated facility location"
    - "how unsplittable flow covering helps scheduling with job dependent cost functions"
    - "the geometry of scheduling"

Connected through hyperedge HE-2 (induced by source paper "geometry of scheduling on multiple machines"):
  with members:
    - "a polynomial time constant approximation for minimizing total weighted flow time"
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "how unsplittable flow covering helps scheduling with job dependent cost functions"
    - "on column restricted and priority covering integer programs"
    - "the geometry of scheduling"

Connected through hyperedge HE-3 (induced by source paper "a unifying optimal control framework for online job scheduling with general cost functions"):
  with members:
    - "stochastic online scheduling on unrelated machines"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "the geometry of scheduling"

Question: Please tell me which class the center node 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.DS(Data Structures and Algorithms)