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 "minimizing the aggregate movements for interval coverage"):
  Abstract: We consider an interval coverage problem. Given $n$ intervals of the same length on a line $L$ and a line segment $B$ on $L$, we want to move the intervals along $L$ such that every point of $B$ is covered by at least one interval and the sum of the moving distances of all intervals is minimized. As a basic geometry problem, it has applications in mobile sensor barrier coverage in wireless sensor networks. The previous work solved the problem in $O(n^2)$ time. In this paper, by discovering many interesting observations and developing new algorithmic techniques, we present an $O(n\log n)$ time algorithm. We also show an $\Omega(n\log n)$ time lower bound for this problem, which implies the optimality of our algorithm.

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 "algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "movement efficient sensor deployment in wireless sensor networks with limited communication range")
  Member "optimal point movement for covering circular regions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "algorithms for covering multiple barriers")
  Member "decomposing coverings and the planar sensor cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "maximizing barrier coverage lifetime with mobile sensors")
  Member "covering a line segment with variable radius discs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "worst case optimal covering of rectangles by disks")
  Member "restricted strip covering and the sensor cover problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "maximizing barrier coverage lifetime with mobile sensors")

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.CG(Computational Geometry)