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 "a fast exact algorithm for airplane refueling problem"):
  Abstract: We consider the airplane refueling problem, where we have a fleet of airplanes that can refuel each other. Each airplane is characterized by specific fuel tank volume and fuel consumption rate, and the goal is to find a drop out order of airplanes that last airplane in the air can reach as far as possible. This problem is equivalent to the scheduling problem $1||\sum w_j (- \frac{1}{C_j})$. Based on the dominance properties among jobs, we reveal some structural properties of the problem and propose a recursive algorithm to solve the problem exactly. The running time of our algorithm is directly related to the number of schedules that do not violate the dominance properties. An experimental study shows our algorithm outperforms state of the art exact algorithms and is efficient on larger instances.

Includes members:
  Member "a primal dual approximation algorithm for min sum single machine scheduling problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a water filling primal dual algorithm for approximating non linear covering problems")
  Member "a polynomial time approximation scheme for the airplane refueling problem":
    also connected through other hyperedges:
      (none)
  Member "how unsplittable flow covering helps scheduling with job dependent cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a water filling primal dual algorithm for approximating non linear covering problems")
  Member "the local global conjecture for scheduling with non linear cost":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling")
  Member "dual techniques for scheduling on a machine with varying speed":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "energy minimization in dag scheduling on mpsocs at run time theory and practice")
  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")

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)