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 "approximating min cost chain constrained spanning trees a reduction from weighted to unweighted problems"):
  Abstract: We study the {\em min-cost chain-constrained spanning-tree} (abbreviated \mcst) problem: find a min-cost spanning tree in a graph subject to degree constraints on a nested family of node sets. We devise the {\em first} polytime algorithm that finds a spanning tree that (i) violates the degree constraints by at most a constant factor {\em and} (ii) whose cost is within a constant factor of the optimum. Previously, only an algorithm for {\em unweighted} \cst was known \cite{olver}, which satisfied (i) but did not yield any cost bounds. This also yields the first result that obtains an $O(1)$-factor for {\em both} the cost approximation and violation of degree constraints for any spanning-tree problem with general degree bounds on node sets, where an edge participates in a super-constant number of degree constraints. #R##N#A notable feature of our algorithm is that we {\em reduce} \mcst to unweighted \cst (and then utilize \cite{olver}) via a novel application of {\em Lagrangian duality} to simplify the {\em cost structure} of the underlying problem and obtain a decomposition into certain uniform-cost subproblems. #R##N#We show that this Lagrangian-relaxation based idea is in fact applicable more generally and, for any cost-minimization problem with packing side-constraints, yields a reduction from the weighted to the unweighted problem. We believe that this reduction is of independent interest. As another application of our technique, we consider the {\em $k$-budgeted matroid basis} problem, where we build upon a recent rounding algorithm of \cite{BansalN16} to obtain an improved $n^{O(k^{1.5}/\epsilon)}$-time algorithm that returns a solution that satisfies (any) one of the budget constraints exactly and incurs a $(1+\epsilon)$-violation of the other budget constraints.

Includes members:
  Member "approximation friendly discrepancy rounding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dependent randomized rounding for clustering and partition systems with knapsack constraints")
  Member "matroidal degree bounded minimum spanning trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "degree bounded generalized polymatroids and approximating the metric many visits tsp")
  Member "on generalizations of network design problems with degree bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a spectral approach to network design")

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)