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 "set it and forget it approximating the set once strip cover problem"):
  Abstract: We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proportion to a radius that can be set just once, but activated at any time. The problem is to find an assignment of radii and activation times that maximizes the length of time during which the entire region is covered. We show that this problem is NP-hard. Second, we show that RoundRobin, the algorithm in which the sensors simply take turns covering the entire region, has a tight approximation guarantee of 3/2 in both Set Once Strip Cover and the more general Strip Cover problem, in which each radius may be set finitely-many times. Moreover, we show that the more general class of duty cycle algorithms, in which groups of sensors take turns covering the entire region, can do no better. Finally, we give an optimal O(n^2 log n)-time algorithm for the related Set Radius Strip Cover problem, in which all sensors must be activated immediately.

Includes members:
  Member "maximizing barrier coverage lifetime with mobile sensors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "separating overlapped intervals on a line")
  Member "connecting a set of circles with minimum sum of radii":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "faster algorithms for some optimization problems on collinear points")
  Member "decomposing coverings and the planar sensor cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimizing the aggregate movements for interval coverage")
  Member "decomposition of multiple coverings into more parts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a characterization of visibility graphs for pseudo polygons")
  Member "restricted strip covering and the sensor cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimizing the aggregate movements for interval coverage")
  Member "set k cover algorithms for energy efficient monitoring in wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "scheduling resource bounded monitoring devices for event detection and isolation in networks")

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)