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 "anchored rectangle and square packings"):
  Abstract: For points $p_1,\ldots , p_n$ in the unit square $[0,1]^2$, an \emph{anchored rectangle packing} consists of interior-disjoint axis-aligned empty rectangles $r_1,\ldots , r_n\subseteq [0,1]^2$ such that point $p_i$ is a corner of the rectangle $r_i$ (that is, $r_i$ is \emph{anchored} at $p_i$) for $i=1,\ldots, n$. We show that for every set of $n$ points in $[0,1]^2$, there is an anchored rectangle packing of area at least $7/12-O(1/n)$, and for every $n\in \mathbf{N}$, there are point sets for which the area of every anchored rectangle packing is at most $2/3$. The maximum area of an anchored \emph{square} packing is always at least $5/32$ and sometimes at most $7/27$. #R##N#The above constructive lower bounds immediately yield constant-factor approximations, of $7/12 -\varepsilon$ for rectangles and $5/32$ for squares, for computing anchored packings of maximum area in $O(n\log n)$ time. We prove that a simple greedy strategy achieves a $9/47$-approximation for anchored square packings, and $1/3$ for lower-left anchored square packings. Reductions to maximum weight independent set (MWIS) yield a QPTAS and a PTAS for anchored rectangle and square packings in $n^{O(1/\varepsilon)}$ and $\exp({\rm poly}(\log (n/\varepsilon)))$ time, respectively.

Includes members:
  Member "approximation schemes for independent set and sparse subsets of polygons":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algorithms for intersection graphs of multiple intervals and pseudo disks")
  Member "on approximating maximum independent set of rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "a constant factor approximation for multi covering with disks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "worst case optimal covering of rectangles by disks")
  Member "quasi polynomial time approximation scheme for sparse subsets of polygons":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient approximation schemes for uniform cost clustering problems in planar graphs")
  Member "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quasi polynomial time approximation schemes for packing and covering problems in planar graphs")
  Member "approximation schemes for maximum weight independent set of rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "approximation algorithms for maximum independent set of pseudo disks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "on the largest empty axis parallel box amidst n points":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deterministic constructions of high dimensional sets with small dispersion")

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)