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 "maximizing non monotone submodular set functions subject to different constraints combined algorithms"):
  Abstract: We study the problem of maximizing constrained non-monotone submodular functions and provide approximation algorithms that improve existing algorithms in terms of either the approximation factor or simplicity. Our algorithms combine existing local search and greedy based algorithms. Different constraints that we study are exact cardinality and multiple knapsack constraints. For the multiple-knapsack constraints we achieve a $(0.25-2\epsilon)$-factor algorithm. #R##N#We also show, as our main contribution, how to use the continuous greedy process for non-monotone functions and, as a result, obtain a $0.13$-factor approximation algorithm for maximization over any solvable down-monotone polytope. The continuous greedy process has been previously used for maximizing smooth monotone submodular function over a down-monotone polytope \cite{CCPV08}. This implies a 0.13-approximation for several discrete problems, such as maximizing a non-negative submodular function subject to a matroid constraint and/or multiple knapsack constraints.

Includes members:
  Member "symmetry and approximability of submodular maximization problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "approximability of monotone submodular function maximization under cardinality and matroid constraints in the streaming model")
  Member "approximations for monotone and non monotone submodular maximization with knapsack constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimization with demand oracles")
  Member "constrained non monotone submodular maximization offline and secretary algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "submodular matroid secretary problem with shortlists")
  Member "a note on concentration of submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "prophet inequalities with linear correlations and augmentations")
  Member "submodular maximization by simulated annealing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal streaming algorithms for submodular maximization with cardinality constraints")
  Member "dependent randomized rounding for matroid polytopes and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint")
  Member "submodular functions extensions distributions and algorithms a survey":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal approximation for unconstrained non submodular minimization")

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)