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: "edge covering with budget constrains"
  Abstract: We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms). #R##N#Goldschmidt and Hochbaum \cite{GH97} show that the mvms problem is NP-hard and they give a 3-approximation algorithm for the problem. We improve \cite{GH97} by giving a ratio of 2. A 2(1+\epsilon)-approximation for the problem follows from the work of Carnes and Shmoys \cite{CS08}. We improve the approximation ratio to 2. algorithm for the problem. We show that the natural LP for \kmin has an integrality gap of 2-o(1). We improve the NP-completeness of \cite{GH97} by proving the pronlem are APX-hard unless a well-known instance of the dense k-subgraph admits a constant ratio. The best approximation guarantee known for this instance of dense k-subgraph is O(n^{2/9}) \cite{BCCFV}. We show that for any constant \rho>1, an approximation guarantee of \rho for the \kmin problem implies a \rho(1+o(1)) approximation for \mwms. Finally, we define we give an exact algorithm for the density version of kmin.

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