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 "on approximating sparse covering integer programs"):
  Abstract: We consider approximation algorithms for covering integer programs of the form min $\langle c, x \rangle $ over $x \in \mathbb{N}^n $ subject to $A x \geq b $ and $x \leq d$; where $A \in \mathbb{R}_{\geq 0}^{m \times n}$, $b \in \mathbb{R}_{\geq 0}^m$, and $c, d \in \mathbb{R}_{\geq 0}^n$ all have nonnegative entries. We refer to this problem as $\operatorname{CIP}$, and the special case without the multiplicity constraints $x \le d$ as $\operatorname{CIP}_{\infty}$. These problems generalize the well-studied Set Cover problem. We make two algorithmic contributions. #R##N#First, we show that a simple algorithm based on randomized rounding with alteration improves or matches the best known approximation algorithms for $\operatorname{CIP}$ and $\operatorname{CIP}_{\infty}$ in a wide range of parameter settings, and these bounds are essentially optimal. As a byproduct of the simplicity of the alteration algorithm and analysis, we can derandomize the algorithm without any loss in the approximation guarantee or efficiency. Previous work by Chen, Harris and Srinivasan [12] which obtained near-tight bounds is based on a resampling-based randomized algorithm whose analysis is complex. #R##N#Non-trivial approximation algorithms for $\operatorname{CIP}$ are based on solving the natural LP relaxation strengthened with knapsack cover (KC) inequalities [5,24,12]. Our second contribution is a fast (essentially near-linear time) approximation scheme for solving the strengthened LP with a factor of $n$ speed up over the previous best running time [5]. #R##N#Together, our contributions lead to near-optimal (deterministic) approximation bounds with near-linear running times for $\operatorname{CIP}$ and $\operatorname{CIP}_{\infty}$.

Includes members:
  Member "approximating the held karp bound for metric tsp in nearly linear time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast and deterministic approximations for k cut")
  Member "partial resampling to approximate covering integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on approximating partial set cover and generalizations")
  Member "a nearly linear time ptas for explicit fractional packing and covering linear programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "dynamic incentive aware learning robust pricing in contextual auctions")
  Member "approximating sparse covering integer programs online":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online unit clustering in higher dimensions")
  Member "submodular function maximization via the multilinear relaxation and contention resolution schemes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model")
  Member "approximation algorithms for covering packing integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)