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 "primal dual and dual fitting analysis of online scheduling algorithms for generalized flow time problems"):
  Abstract: We study online scheduling problems on a single processor that can be viewed as extensions of the well-studied problem of minimizing total weighted flow time. In particular, we provide a framework of analysis that is derived by duality properties, does not rely on potential functions and is applicable to a variety of scheduling problems. A key ingredient in our approach is bypassing the need for "black-box" rounding of fractional solutions, which yields improved competitive ratios. #R##N#We begin with an interpretation of Highest-Density-First (HDF) as a primal-dual algorithm, and a corresponding proof that HDF is optimal for total fractional weighted flow time (and thus scalable for the integral objective). Building upon the salient ideas of the proof, we show how to apply and extend this analysis to the more general problem of minimizing $\sum_j w_j g(F_j)$, where $w_j$ is the job weight, $F_j$ is the flow time and $g$ is a non-decreasing cost function. Among other results, we present improved competitive ratios for the setting in which $g$ is a concave function, and the setting of same-density jobs but general cost functions. We further apply our framework of analysis to online weighted completion time with general cost functions as well as scheduling under polyhedral constraints.

Includes members:
  Member "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic weighted fairness with minimal disruptions")
  Member "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a unifying optimal control framework for online job scheduling with general cost functions")
  Member "how unsplittable flow covering helps scheduling with job dependent cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a water filling primal dual algorithm for approximating non linear covering problems")
  Member "online primal dual for non linear optimization with applications to speed scaling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "station assignment with reallocation")
  Member "the geometry of scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a water filling primal dual algorithm for approximating non linear covering problems")
  Member "greedy facility location algorithms analyzed using dual fitting with factor revealing lp":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cache optimization models and algorithms")

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.DS(Data Structures and Algorithms)