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 "approximation algorithms for max morse matching"):
  Abstract: In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch. We describe two different approximation algorithms for the Max-Morse Matching Problem. For $D$-dimensional simplicial complexes, we obtain a $\frac{(D+1)}{(D^2+D+1)}$-factor approximation ratio using a simple edge reorientation algorithm that removes cycles. Our second result is an algorithm that provides a $\frac{2}{D}$-factor approximation for simplicial manifolds by processing the simplices in increasing order of dimension. One application of these algorithms is towards efficient homology computation of simplicial complexes. Experiments using a prototype implementation on several datasets indicate that the algorithm computes near optimal results.

Includes members:
  Member "parameterized complexity of discrete morse theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "collapsibility to a subcomplex of a given dimension is np complete")
  Member "a new matching algorithm for multidimensional persistence":
    also connected through other hyperedges:
      (none)
  Member "optimal topological simplification of discrete functions on surfaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "persistent homology of unweighted complex networks via discrete morse theory")

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)