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 "beyond o 2 n in domination type problems"):
  Abstract: In this paper we provide algorithms faster than O*(2^n) for several NP-complete domination-type problems. More precisely, we provide: an algorithm for CAPACITATED DOMINATING SET that solves it in O(1.89^n), a branch-and-reduce algorithm solving LARGEST IRREDUNDANT SET in O(1.9657^n) time and a simple iterative-DFS algorithm for SMALLEST INCLUSION-MAXIMAL IRREDUNDANT SET that solves it in O(1.999956^n) time. #R##N#We also provide an exponential approximation scheme for CAPACITATED DOMINATING SET. All algorithms require polynomial space. Despite the fact that the discussed problems are quite similar to the DOMINATING SET problem, we are not aware of any published algorithms solving these problems faster than the obvious O*(2^n) solution prior to this paper.

Includes members:
  Member "an exponential time 2 approximation algorithm for bandwidth":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sparsification and subexponential approximation")
  Member "trimmed moebius inversion and graphs of bounded degree":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding hamiltonian cycle in graphs of bounded treewidth experimental evaluation")

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.DS(Data Structures and Algorithms)