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 "near linear time approximation schemes for steiner tree and forest in low dimensional spaces"):
  Abstract: We give an algorithm that computes a $(1+\epsilon)$-approximate Steiner forest in near-linear time $n \cdot 2^{(1/\epsilon)^{O(ddim^2)} (\log \log n)^2}$. This is a dramatic improvement upon the best previous result due to Chan et al., who gave a runtime of $n^{2^{O(ddim)}} \cdot 2^{(ddim/\epsilon)^{O(ddim)} \sqrt{\log n}}$. #R##N#For Steiner tree our methods achieve an even better runtime $n (\log n)^{(1/\epsilon)^{O(ddim^2)}}$ in doubling spaces. For Euclidean space the runtime can be reduced to $2^{(1/\epsilon)^{O(d^2)}} n \log n$, improving upon the result of Arora in fixed dimension $d$.

Includes members:
  Member "greedy spanners are optimal in doubling metrics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed construction of light networks")
  Member "the greedy spanner is existentially optimal":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a polynomial time algorithm for almost optimal vertex fault tolerant spanners")
  Member "a ptas for the steiner forest problem in doubling metrics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "near linear time approximation schemes for clustering in doubling metrics")
  Member "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a quasi polynomial algorithm for well spaced hyperbolic tsp")
  Member "a light metric spanner":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the edge crossings of the greedy spanner")
  Member "a polynomial time approximation scheme for euclidean steiner forest":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "survivable network design for group connectivity in low treewidth graphs")
  Member "an efficient polynomial time approximation scheme for steiner forest in planar graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")
  Member "approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "tight bounds for planar strongly connected steiner subgraph with fixed number of terminals and extensions")

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)