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: "dual techniques for scheduling on a machine with varying speed"
  Abstract: We study scheduling problems on a machine with varying speed. Assuming a known speed function we ask for a cost-efficient scheduling solution. Our main result is a PTAS for minimizing the total weighted completion time in this setting. This also implies a PTAS for the closely related problem of scheduling to minimize generalized global cost functions. The key to our results is a re-interpretation of the problem within the well-known two-dimensional Gantt chart: instead of the standard approach of scheduling in the {\em time-dimension}, we construct scheduling solutions in the weight-dimension. #R##N#We also consider a dynamic problem variant in which deciding upon the speed is part of the scheduling problem and we are interested in the tradeoff between scheduling cost and speed-scaling cost, which is typically the energy consumption. We observe that the optimal order is independent of the energy consumption and that the problem can be reduced to the setting where the speed of the machine is fixed, and thus admits a PTAS. Furthermore, we provide an FPTAS for the NP-hard problem variant in which the machine can run only on a fixed number of discrete speeds. Finally, we show how our results can be used to obtain a~$(2+\eps)$-approximation for scheduling preemptive jobs with release dates on multiple identical parallel machines.

Connected through hyperedge HE-1 (induced by source paper "a fast exact algorithm for airplane refueling problem"):
  with members:
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "a polynomial time approximation scheme for the airplane refueling problem"
    - "how unsplittable flow covering helps scheduling with job dependent cost functions"
    - "the local global conjecture for scheduling with non linear cost"
    - "the geometry of scheduling"

Connected through hyperedge HE-2 (induced by source paper "energy minimization in dag scheduling on mpsocs at run time theory and practice"):
  with members:
    - "scheduling trees of malleable tasks for sparse linear algebra"
    - "reclaiming the energy of a schedule models and algorithms"

Connected through hyperedge HE-3 (induced by source paper "submodular maximization with uncertain knapsack capacity"):
  with members:
    - "adaptivity gaps for stochastic probing submodular and xos functions"
    - "online contention resolution schemes"
    - "submodular stochastic probing on matroids"
    - "packing a knapsack of unknown capacity"
    - "approximation algorithms for correlated knapsacks and non martingale bandits"
    - "adaptive submodularity theory and applications in active learning and stochastic optimization"

Connected through hyperedge HE-4 (induced by source paper "a primal dual approximation algorithm for min sum single machine scheduling problems"):
  with members:
    - "how unsplittable flow covering helps scheduling with job dependent cost functions"
    - "the geometry of scheduling"
    - "approximability of sparse integer programs"
    - "scheduling with outliers"

Connected through hyperedge HE-5 (induced by source paper "mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling"):
  with members:
    - "resource cost aware scheduling"
    - "scheduling under dynamic speed scaling for minimizing weighted completion time and energy consumption"
    - "the local global conjecture for scheduling with non linear cost"
    - "energy in computing systems with speed scaling optimization and mechanisms design"

Connected through hyperedge HE-6 (induced by source paper "a polynomial time approximation scheme for the airplane refueling problem"):
  with members:
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "how unsplittable flow covering helps scheduling with job dependent cost functions"
    - "polynomial time approximation schemes for the traveling repairman and other minimum latency problems"
    - "the geometry of scheduling"

Connected through hyperedge HE-7 (induced by source paper "scheduling under dynamic speed scaling for minimizing weighted completion time and energy consumption"):
  with members:
    - "resource cost aware scheduling"
    - "mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling"

Connected through hyperedge HE-8 (induced by source paper "how unsplittable flow covering helps scheduling with job dependent cost functions"):
  with members:
    - "a primal dual approximation algorithm for min sum single machine scheduling problems"
    - "a 4 approximation for scheduling on a single machine with general cost function"
    - "a constant factor approximation algorithm for unsplittable flow on paths"
    - "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)