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 "quasi polynomial time approximation scheme for sparse subsets of polygons"):
  Abstract: We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamaszek and Wiese \cite{aw-asmwi-13, aw-qmwis-14} to polygons of arbitrary complexity. Surprisingly, the algorithm also works or computing the largest subset of the given set of polygons that has some sparsity condition. For example, we show that one can approximate the largest subset of polygons, such that the intersection graph of the subset does not contain a cycle of length $4$ (i.e., $K_{2,2}$).

Includes members:
  Member "qptas for geometric set cover problems via optimal separators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal parameterized algorithms for planar facility location problems using voronoi diagrams")
  Member "approximation schemes for maximum weight 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 "approximation algorithms for maximum independent set of pseudo disks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "a simple proof of the existence of a planar separator":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "computing circle packing representations of planar graphs")
  Member "geometric packing under non uniform constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximation schemes for independent set and sparse subsets of polygons")
  Member "being fat and friendly is not enough":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "approximation schemes for independent set and sparse subsets of polygons")

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)