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 "online covering with sum of ell_q norm objectives"):
  Abstract: We consider fractional online covering problems with $\ell_q$-norm objectives. The problem of interest is of the form $\min\{ f(x) \,:\, Ax\ge 1, x\ge 0\}$ where $f(x)=\sum_{e} c_e \|x(S_e)\|_{q_e} $ is the weighted sum of $\ell_q$-norms and $A$ is a non-negative matrix. The rows of $A$ (i.e. covering constraints) arrive online over time. We provide an online $O(\log d+\log \rho)$-competitive algorithm where $\rho = \frac{\max a_{ij}}{\min a_{ij}}$ and $d$ is the maximum of the row sparsity of $A$ and $\max |S_e|$. This is based on the online primal-dual framework where we use the dual of the above convex program. Our result expands the class of convex objectives that admit good online algorithms: prior results required a monotonicity condition on the objective $f$ which is not satisfied here. This result is nearly tight even for the linear special case. As direct applications we obtain (i) improved online algorithms for non-uniform buy-at-bulk network design and (ii) the first online algorithm for throughput maximization under $\ell_p$-norm edge capacities.

Includes members:
  Member "welfare maximization with production costs a primal dual approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reducing inefficiency in carbon auctions with imperfect competition")
  Member "online packing and covering framework with convex objectives":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynamic service placement for mobile micro clouds with predicted future costs")
  Member "approximating sparse covering integer programs online":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on approximating sparse covering integer programs")
  Member "welfare and profit maximization with production costs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reducing inefficiency in carbon auctions with imperfect competition")

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)