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 "partial resampling to approximate covering integer programs"):
  Abstract: We consider column-sparse positive covering integer programs, which generalize set cover and which have attracted a long line of research developing (randomized) approximation algorithms. We develop a new rounding scheme based on the Partial Resampling variant of the Lov\'{a}sz Local Lemma developed by Harris \& Srinivasan (2013). This achieves an approximation ratio of $1 + \frac{\ln (\Delta_1+1)}{a_{\text{min}}} + O(\sqrt{ \frac{\log (\Delta_1+1)}{a_{\text{min}}}} )$, where $a_{\text{min}}$ is the minimum covering constraint and $\Delta_1$ is the maximum $\ell_1$-norm of any column of the covering matrix (whose entries are scaled to lie in $[0,1]$). When there are additional constraints on the sizes of the variables, we show an approximation ratio of $1 + O(\frac{\ln (\Delta_1+1)}{a_{\text{min}} \epsilon} + \sqrt{ \frac{\log (\Delta_1+1)}{a_{\text{min}}}})$ to satisfy these size constraints up to multiplicative factor $1 + \epsilon$, or an approximation of ratio of $\ln \Delta_0 + O(\sqrt{\log \Delta_0})$ to satisfy the size constraints exactly (where $\Delta_0$ is the maximum number of non-zero entries in any column of the covering matrix). We also show nearly-matching inapproximability and integrality-gap lower bounds. These results improve asymptotically, in several different ways, over results shown by Srinivasan (2006) and Kolliopoulos \& Young (2005). #R##N#We show also that our algorithm automatically handles multi-criteria programs, efficiently achieving approximation ratios which are essentially equivalent to the single-criterion case and which apply even when the number of criteria is large.

Includes members:
  Member "lopsidependency in the moser tardos framework beyond the lopsided lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deterministic algorithms for the lovasz local lemma simpler more general and more parallel")
  Member "nearly linear work algorithms for mixed packing covering and facility location linear programs":
    also connected through other hyperedges:
      (none)
  Member "tighter inapproximability for set cover":
    also connected through other hyperedges:
      (none)
  Member "a constructive proof of the general lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "scattering and sparse partitions and their applications")
  Member "approximation algorithms for covering packing integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computing a small agreeable set of indivisible items")

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)