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: "restricted strip covering and the sensor cover problem"
  Abstract: Given a set of objects with durations (jobs) that cover a base region, can we schedule the jobs to maximize the duration the original region remains covered? We call this problem the sensor cover problem. This problem arises in the context of covering a region with sensors. For example, suppose you wish to monitor activity along a fence by sensors placed at various fixed locations. Each sensor has a range and limited battery life. The problem is to schedule when to turn on the sensors so that the fence is fully monitored for as long as possible. This one dimensional problem involves intervals on the real line. Associating a duration to each yields a set of rectangles in space and time, each specified by a pair of fixed horizontal endpoints and a height. The objective is to assign a position to each rectangle to maximize the height at which the spanning interval is fully covered. We call this one dimensional problem restricted strip covering. If we replace the covering constraint by a packing constraint, the problem is identical to dynamic storage allocation, a scheduling problem that is a restricted case of the strip packing problem. We show that the restricted strip covering problem is NP-hard and present an O(log log n)-approximation algorithm. We present better approximations or exact algorithms for some special cases. For the uniform-duration case of restricted strip covering we give a polynomial-time, exact algorithm but prove that the uniform-duration case for higher-dimensional regions is NP-hard. Finally, we consider regions that are arbitrary sets, and we present an O(log n)-approximation algorithm.

Connected through hyperedge HE-1 (induced by source paper "minimizing the aggregate movements for interval coverage"):
  with members:
    - "maximizing barrier coverage lifetime with mobile sensors"
    - "algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain"
    - "optimal point movement for covering circular regions"
    - "decomposing coverings and the planar sensor cover problem"
    - "covering a line segment with variable radius discs"

Connected through hyperedge HE-2 (induced by source paper "maximizing barrier coverage lifetime with mobile sensors"):
  with members:
    - "algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain"
    - "set it and forget it approximating the set once strip cover problem"
    - "decomposing coverings and the planar sensor cover problem"
    - "covering a line segment with variable radius discs"

Connected through hyperedge HE-3 (induced by source paper "set it and forget it approximating the set once strip cover problem"):
  with members:
    - "maximizing barrier coverage lifetime with mobile sensors"
    - "connecting a set of circles with minimum sum of radii"
    - "decomposing coverings and the planar sensor cover problem"
    - "decomposition of multiple coverings into more parts"
    - "set k cover algorithms for energy efficient monitoring in wireless sensor networks"

Connected through hyperedge HE-4 (induced by source paper "decomposing coverings and the planar sensor cover problem"):
  with members:
    - "decomposition of multiple coverings into more parts"

Connected through hyperedge HE-5 (induced by source paper "decomposition of multiple coverings into more parts"):
  with members:
    - "decomposing coverings and the planar sensor cover problem"

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)