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: "randomized rounding without solving the linear program"
  Abstract: Randomized rounding is a standard method, based on the probabilistic method, for designing combinatorial approximation algorithms. In Raghavan's seminal paper introducing the method (1988), he writes: "The time taken to solve the linear program relaxations of the integer programs dominates the net running time theoretically (and, most likely, in practice as well)." #R##N#This paper explores how this bottleneck can be avoided for randomized rounding algorithms for packing and covering problems (linear programs, or mixed integer linear programs, having no negative coefficients). The resulting algorithms are greedy algorithms, and are faster and simpler to implement than standard randomized-rounding algorithms. #R##N#This approach can also be used to understand Lagrangian-relaxation algorithms for packing/covering linear programs: such algorithms can be viewed as as (derandomized) randomized-rounding schemes.

Connected through hyperedge HE-1 (induced by source paper "distributed edge connectivity in sublinear time"):
  with members:
    - "improved distributed expander decomposition and nearly optimal triangle enumeration"
    - "small cuts and connectivity certificates a fault tolerant approach"
    - "distributed triangle detection via expander decomposition"
    - "graph sparsification spectral sketches and faster resistance computation via short cycle decompositions"
    - "distributed exact weighted all pairs shortest paths in near linear time"
    - "expander decomposition and pruning faster stronger and simpler"
    - "a faster distributed single source shortest paths algorithm"
    - "distributed exact shortest paths in sublinear time"

Connected through hyperedge HE-2 (induced by source paper "distributed dense subgraph detection and low outdegree orientation"):
  with members:
    - "near optimal fully dynamic densest subgraph"
    - "improved distributed expander decomposition and nearly optimal triangle enumeration"
    - "distributed approximation algorithms for maximum matching in graphs and hypergraphs"
    - "improved deterministic distributed matching via rounding"
    - "improved distributed degree splitting and edge coloring"
    - "on derandomizing local distributed algorithms"
    - "distributed degree splitting edge coloring and orientations"
    - "densest subgraph in dynamic graph streams"

Connected through hyperedge HE-3 (induced by source paper "near optimal online algorithms and fast approximation algorithms for resource allocation problems"):
  with members:
    - "fast algorithms for online stochastic convex programming"
    - "primal beats dual on online packing lps in the random order model"
    - "online submodular welfare maximization greedy is optimal"
    - "selective call out and real time bidding"
    - "online stochastic matching online actions based on offline statistics"
    - "online stochastic packing applied to display ad allocation"
    - "a dynamic near optimal algorithm for online linear programming"
    - "online stochastic matching beating 1 1 e"

Connected through hyperedge HE-4 (induced by source paper "minimum cut in o m log 2 n time"):
  with members:
    - "a simple algorithm for minimum cuts in near linear time"
    - "faster algorithms for edge connectivity via random 2 out contractions"
    - "parallel minimum cuts in near linear work and low depth"
    - "local flow partitioning for faster edge connectivity"
    - "computing maximum flow with augmenting electrical flows"
    - "deterministic edge connectivity in near linear time"
    - "maintaining information in fully dynamic trees with top trees"
    - "minimum cuts in near linear time"

Connected through hyperedge HE-5 (induced by source paper "online learning with an almost perfect expert"):
  with members:
    - "online learning sufficient statistics and the burkholder method"
    - "towards optimal algorithms for prediction with expert advice"
    - "online bandit learning against an adaptive adversary from regret to policy regret"
    - "a stochastic view of optimal regret through minimax duality"

Connected through hyperedge HE-6 (induced by source paper "multi objective maximization of monotone submodular functions with cardinality constraint"):
  with members:
    - "robust monotone submodular function maximization"
    - "robust optimization for non convex objectives"
    - "lazier than lazy greedy"
    - "near optimally teaching the crowd to classify"
    - "near optimal nonmyopic value of information in graphical models"
    - "symmetry and approximability of submodular maximization problems"
    - "sequential and parallel algorithms for mixed packing and covering"

Connected through hyperedge HE-7 (induced by source paper "sparse sums of positive semidefinite matrices"):
  with members:
    - "a matrix hyperbolic cosine algorithm and applications"
    - "faster spectral sparsification and numerical algorithms for sdd matrices"
    - "a parallel approximation algorithm for positive semidefinite programming"
    - "near optimal column based matrix reconstruction"
    - "graph sparsification by edge connectivity and random spanning trees"
    - "towards an sdp based approach to spectral methods a nearly linear time algorithm for graph partitioning and decomposition"
    - "a linear time algorithm for sparsification of unweighted graphs"
    - "graph sparsification via refinement sampling"

Connected through hyperedge HE-8 (induced by source paper "an approximation algorithm for path computation and function placement in sdns"):
  with members:
    - "competitive path computation and function placement in sdns"
    - "service chain and virtual network embeddings approximations using randomized rounding"
    - "online admission control and embedding of service chains"
    - "software defined networking a comprehensive survey"
    - "specifying and placing chains of virtual network functions"
    - "merlin a language for provisioning network resources"

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)