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 water filling primal dual algorithm for approximating non linear covering problems"):
  Abstract: Obtaining strong linear relaxations of capacitated covering problems constitute a major technical challenge even for simple settings. For one of the most basic cases, the Knapsack-Cover (Min-Knapsack) problem, the relaxation based on knapsack-cover inequalities achieves an integrality gap of 2. These inequalities have been exploited in more general environments, many of which admit primal-dual approximation algorithms. #R##N#Inspired by problems from power and transport systems, we introduce a new general setting in which items can be taken fractionally to cover a given demand. The cost incurred by an item is given by an arbitrary non-decreasing function of the chosen fraction. We generalize the knapsack-cover inequalities to this setting an use them to obtain a $(2+\varepsilon)$-approximate primal-dual algorithm. Our procedure has a natural interpretation as a bucket-filling algorithm, which effectively balances the difficulties given by having different slopes in the cost functions: when some superior portion of an item presents a low slope, it helps to increase the priority with which the inferior portions may be taken. We also present a rounding algorithm with an approximation guarantee of 2. #R##N#We generalize our algorithm to the Unsplittable Flow-Cover problem on a line, also for the setting where items can be taken fractionally. For this problem we obtain a $(4+\varepsilon)$-approximation algorithm in polynomial time, almost matching the $4$-approximation known for the classical setting.

Includes members:
  Member "geometry of scheduling on multiple machines":
    also connected through other hyperedges:
      (none)
  Member "scheduling to approximate minimization objectives on identical machines":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "geometry of scheduling on multiple machines")
  Member "constant approximation algorithm for non uniform capacitated multi item lot sizing via strong covering inequalities":
    also connected through other hyperedges:
      (none)
  Member "small extended formulation for knapsack cover inequalities from monotone circuits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on bounded pitch inequalities for the min knapsack polytope")
  Member "a primal dual approximation algorithm for min sum single machine scheduling problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a fast exact algorithm for airplane refueling problem")
  Member "lp based algorithms for capacitated facility location":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "easy capacitated facility location problems with connections to lot sizing")
  Member "how unsplittable flow covering helps scheduling with job dependent cost functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a fast exact algorithm for airplane refueling problem")
  Member "the geometry of scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a fast exact algorithm for airplane refueling problem")

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)