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: "robust and maxmin optimization under matroid and knapsack uncertainty sets"
  Abstract: Consider the following problem: given a set system (U,I) and an edge-weighted graph G = (U, E) on the same universe U, find the set A in I such that the Steiner tree cost with terminals A is as large as possible: "which set in I is the most difficult to connect up?" This is an example of a max-min problem: find the set A in I such that the value of some minimization (covering) problem is as large as possible. #R##N#In this paper, we show that for certain covering problems which admit good deterministic online algorithms, we can give good algorithms for max-min optimization when the set system I is given by a p-system or q-knapsacks or both. This result is similar to results for constrained maximization of submodular functions. Although many natural covering problems are not even approximately submodular, we show that one can use properties of the online algorithm as a surrogate for submodularity. #R##N#Moreover, we give stronger connections between max-min optimization and two-stage robust optimization, and hence give improved algorithms for robust versions of various covering problems, for cases where the uncertainty sets are given by p-systems and q-knapsacks.

Connected through hyperedge HE-1 (induced by source paper "approximation algorithms for distributionally robust stochastic optimization with black box distributions"):
  with members:
    - "online allocation with traffic spikes mixing adversarial and stochastic models"
    - "making the most of your samples"
    - "thresholded covering algorithms for robust and max min optimization"
    - "greedy facility location algorithms analyzed using dual fitting with factor revealing lp"

Connected through hyperedge HE-2 (induced by source paper "approximate multi matroid intersection via iterative refinement"):
  with members:
    - "generalized hypergraph matching via iterated packing and local ratio"
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"
    - "matroidal degree bounded minimum spanning trees"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "on generalizations of network design problems with degree bounds"

Connected through hyperedge HE-3 (induced by source paper "constrained submodular maximization via greedy local search"):
  with members:
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "a tight combinatorial algorithm for submodular maximization subject to a matroid constraint"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "thresholded covering algorithms for robust and max min optimization"

Connected through hyperedge HE-4 (induced by source paper "submodular function maximization via the multilinear relaxation and contention resolution schemes"):
  with members:
    - "symmetry and approximability of submodular maximization problems"
    - "maximizing non monotone submodular set functions subject to different constraints combined algorithms"
    - "geometric packing under non uniform constraints"
    - "mechanism design via correlation gap"
    - "a note on concentration of submodular functions"
    - "submodular maximization by simulated annealing"
    - "thresholded covering algorithms for robust and max min optimization"
    - "correlation robust stochastic optimization"

Connected through hyperedge HE-5 (induced by source paper "thresholded covering algorithms for robust and max min optimization"):
  with members:
    - "correlation robust stochastic optimization"
    - "algorithms for probabilistically constrained models of risk averse stochastic optimization with black box distributions"
    - "dial a ride from k forest"

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)