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 "on the complexity of barrier resilience for fat regions"):
  Abstract: In the \emph {barrier resilience} problem (introduced by Kumar {\em et al.}, Wireless Networks 2007), we are given a collection of regions of the plane, acting as obstacles, and we would like to remove the minimum number of regions so that two fixed points can be connected without crossing any region. In this paper, we show that the problem is NP-hard when the collection only contains fat regions with bounded ply $\ply$ (even when they are axis-aligned rectangles of aspect ratio $1 : (1 + \eps)$). We also show that the problem is fixed-parameter tractable (FPT) for unit disks and for similarly-sized $\beta$-fat regions with bounded ply $\ply$ and $O(1)$ pairwise boundary intersections. #R##N#We then use our FPT algorithm to construct an $(1+\eps)$-approximation algorithm that runs in $O(2^{f(\Delta, \eps,\beta)}n^7)$ time, where $f\in O(\frac{\ply^4\beta^8}{\eps^4}\log(\beta\ply/\eps))$.

Includes members:
  Member "algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "movement efficient sensor deployment in wireless sensor networks with limited communication range")
  Member "on isolating points using disks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "two optimization problems for unit disks")

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.CC(Computational Complexity)