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: "approximation schemes for independent set and sparse subsets of polygons"
  Abstract: We present an $(1+\varepsilon)$-approximation algorithm with quasi-polynomial running time for computing the maximum weight independent set of polygons out of a given set of polygons in the plane (specifically, the running time is $n^{O( \mathrm{poly}( \log n, 1/\varepsilon))}$). Contrasting this, the best known polynomial time algorithm for the problem has an approximation ratio of~$n^{\varepsilon}$. Surprisingly, we can extend the algorithm to the problem of computing the maximum weight subset of the given set of polygons whose intersection graph fulfills some sparsity condition. For example, we show that one can approximate the maximum weight subset of polygons, such that the intersection graph of the subset is planar or does not contain a cycle of length $4$ (i.e., $K_{2,2}$). Our algorithm relies on a recursive partitioning scheme, whose backbone is the existence of balanced cuts with small complexity that intersect polygons from the optimal solution of a small total weight. #R##N#For the case of large axis-parallel rectangles, we provide a polynomial time $(1+\varepsilon)$-approximation for the maximum weight independent set. Specifically, we consider the problem where each rectangle has one edge whose length is at least a constant fraction of the length of the corresponding edge of the bounding box of all the input elements. This is now the most general case for which a PTAS is known, and it requires a new and involved partitioning scheme, which should be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "algorithms for intersection graphs of multiple intervals and pseudo disks"):
  with members:
    - "on approximating partial set cover and generalizations"
    - "on pseudo disk hypergraphs"
    - "epsilon approximations and epsilon nets"
    - "on partial covering for geometric set systems"
    - "approximation schemes for maximum weight independent set of rectangles"
    - "approximation algorithms for maximum independent set of pseudo disks"
    - "improved approximation algorithms for geometric set cover"
    - "a new multilayered pcp and the hardness of hypergraph vertex cover"

Connected through hyperedge HE-2 (induced by source paper "optimality program in segment and string graphs"):
  with members:
    - "planar graphs as l intersection or l contact graphs"
    - "finding hitting and packing cycles in subexponential time on unit disk graphs"
    - "generalized feedback vertex set problems on bounded treewidth graphs chordality is the key to single exponential parameterized algorithms"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "intersection graphs of segments and exists mathbb r"
    - "quasi polynomial time approximation scheme for sparse subsets of polygons"
    - "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"
    - "the clique problem in ray intersection graphs"

Connected through hyperedge HE-3 (induced by source paper "anchored rectangle and square packings"):
  with members:
    - "on approximating maximum independent set of rectangles"
    - "a constant factor approximation for multi covering with disks"
    - "quasi polynomial time approximation scheme for sparse subsets of polygons"
    - "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"
    - "approximation schemes for maximum weight independent set of rectangles"
    - "approximation algorithms for maximum independent set of pseudo disks"
    - "on the largest empty axis parallel box amidst n points"
    - "the problem of compatible representatives"

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