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: "dependent randomized rounding for matroid polytopes and applications"
  Abstract: Motivated by several applications, we consider the problem of randomly rounding a fractional solution in a matroid (base) polytope to an integral one. We consider the pipage rounding technique and also present a new technique, randomized swap rounding. Our main technical results are concentration bounds for functions of random variables arising from these rounding techniques. We prove Chernoff-type concentration bounds for linear functions of random variables arising from both techniques, and also a lower-tail exponential bound for monotone submodular functions of variables arising from randomized swap rounding. #R##N#The following are examples of our applications: (1) We give a (1-1/e-epsilon)-approximation algorithm for the problem of maximizing a monotone submodular function subject to 1 matroid and k linear constraints, for any constant k and epsilon>0. (2) We present a result on minimax packing problems that involve a matroid base constraint. We give an O(log m / log log m)-approximation for the general problem Min {lambda: x \in {0,1}^N, x \in B(M), Ax <= lambda b}, where m is the number of packing constraints. (3) We generalize the continuous greedy algorithm to problems involving multiple submodular functions, and use it to find a (1-1/e-epsilon)-approximate pareto set for the problem of maximizing a constant number of monotone submodular functions subject to a matroid constraint. An example is the Submodular Welfare Problem where we are looking for an approximate pareto set with respect to individual players' utilities.

Connected through hyperedge HE-1 (induced by source paper "an optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint"):
  with members:
    - "understanding the correlation gap for matchings"
    - "submodular maximization through the lens of linear programming"
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization beyond 1 e"
    - "online contention resolution schemes"
    - "non negative submodular stochastic probing via stochastic contention resolution schemes"
    - "a stochastic probing problem with applications"
    - "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems"

Connected through hyperedge HE-2 (induced by source paper "an optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model"):
  with members:
    - "an exponential speedup in parallel running time for submodular maximization without loss in approximation"
    - "non monotone submodular maximization with nearly optimal adaptivity complexity"
    - "submodular maximization with matroid and packing constraints in parallel"
    - "submodular function maximization in parallel via the multilinear relaxation"
    - "submodular maximization with optimal approximation adaptivity and query complexity"
    - "non monotone submodular maximization in exponentially fewer iterations"
    - "submodular maximization with nearly optimal approximation and adaptivity in nearly linear time"

Connected through hyperedge HE-3 (induced by source paper "submodular maximization through the lens of linear programming"):
  with members:
    - "greed is good near optimal submodular maximization via greedy optimization"
    - "constrained submodular maximization via a non symmetric technique"
    - "deterministic algorithms for submodular maximization problems"
    - "a k 3 2 approximation algorithm for monotone submodular k set packing and general k exchange systems"
    - "submodular function maximization via the multilinear relaxation and contention resolution schemes"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-4 (induced by source paper "practical scalability for stackelberg security games"):
  with members:
    - "safe and nested subgame solving for imperfect information games"
    - "the mysteries of security games equilibrium computation becomes combinatorial algorithm design"

Connected through hyperedge HE-5 (induced by source paper "pipage rounding pessimistic estimators and matrix concentration"):
  with members:
    - "from joint convexity of quantum relative entropy to a concavity theorem of lieb"
    - "near optimal column based matrix reconstruction"
    - "randomized algorithms for matrices and data"
    - "efficient volume sampling for row column subset selection"
    - "a simpler approach to matrix completion"
    - "the asymmetric traveling salesman problem on graphs with bounded genus"
    - "twice ramanujan sparsifiers"
    - "an improved approximation algorithm for the column subset selection problem"

Connected through hyperedge HE-6 (induced by source paper "ranking with diverse intents and correlated contents"):
  with members:
    - "approximation algorithms for maximum independent set of pseudo disks"
    - "a note on the generalized min sum set cover problem"
    - "minimum latency submodular cover"
    - "when lp is the cure for your matching woes improved bounds for stochastic matchings"
    - "ranking with submodular valuations"
    - "a unified approach to ranking in probabilistic databases"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-7 (induced by source paper "maximizing non monotone submodular set functions subject to different constraints combined algorithms"):
  with members:
    - "symmetry and approximability of submodular maximization problems"
    - "approximations for monotone and non monotone submodular maximization with knapsack constraints"
    - "constrained non monotone submodular maximization offline and secretary algorithms"
    - "a note on concentration of submodular functions"
    - "submodular maximization by simulated annealing"
    - "submodular functions extensions distributions and algorithms a survey"

Connected through hyperedge HE-8 (induced by source paper "submodular functions learnability structure and optimization"):
  with members:
    - "symmetry and approximability of submodular maximization problems"
    - "submodular functions are noise stable"
    - "learning valuation functions"
    - "a note on concentration of submodular functions"
    - "is submodularity testable"
    - "privately releasing conjunctions and the statistical query barrier"
    - "submodular maximization by simulated annealing"
    - "submodular approximation sampling based algorithms and lower bounds"

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)