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: "an approximation algorithm for uniform capacitated k median problem with 1 epsilon capacity violation"
  Abstract: We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities or the capacities. While the standard LP-relaxation can only be used for algorithms violating one of the two by a factor of at least two, Shi Li [SODA'15, SODA'16] gave algorithms violating the number of facilities by a factor of 1+{\epsilon} exploring properties of extended relaxations. #R##N#In this paper we develop a constant factor approximation algorithm for Uniform Capacitated k-Median violating only the capacities by a factor of 1+{\epsilon}. The algorithm is based on a configuration LP. Unlike in the algorithms violating the number of facilities, we cannot simply open extra few facilities at selected locations. Instead, our algorithm decides about the facility openings in a carefully designed dependent rounding process.

Connected through hyperedge HE-1 (induced by source paper "streaming balanced clustering"):
  with members:
    - "a constant parameterized approximation for hard capacitated k means"
    - "performance of johnson lindenstrauss transform for k means and k medians clustering"
    - "constant factor fpt approximation for capacitated k median"
    - "nearly optimal dynamic k means clustering for high dimensional data"
    - "relative error tensor low rank approximation"
    - "clustering high dimensional dynamic data streams"
    - "distributed low rank approximation of implicit functions of a matrix"
    - "new frameworks for offline and streaming coreset constructions"

Connected through hyperedge HE-2 (induced by source paper "a constant fpt approximation algorithm for hard capacitated k means"):
  with members:
    - "constant factor fpt approximation for capacitated k median"
    - "greedy bi criteria approximations for k medians and k means"
    - "better guarantees for k means and euclidean k median by primal dual algorithms"
    - "local search yields a ptas for k means in doubling metrics"
    - "local search yields approximation schemes for k means and k median in euclidean and minor free metrics"
    - "on variants of k means clustering"
    - "improved and simplified inapproximability for k means"
    - "the hardness of approximation of euclidean k means"

Connected through hyperedge HE-3 (induced by source paper "a constant parameterized approximation for hard capacitated k means"):
  with members:
    - "constant factor fpt approximation for capacitated k median"
    - "greedy bi criteria approximations for k medians and k means"
    - "local search yields a ptas for k means in doubling metrics"
    - "local search yields approximation schemes for k means and k median in euclidean and minor free metrics"
    - "the hardness of approximation of euclidean k means"
    - "on uniform capacitated k median beyond the natural lp relaxation"

Connected through hyperedge HE-4 (induced by source paper "a constant factor approximation for capacitated min max tree cover"):
  with members:
    - "a ptas for bounded capacity vehicle routing in planar graphs"
    - "a ptas for minimum makespan vehicle routing in trees"
    - "iterative partial rounding for vertex cover with hard capacities"
    - "tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs"
    - "a new approximation technique for resource allocation problems"

Connected through hyperedge HE-5 (induced by source paper "improved local search based approximation algorithm for hard uniform capacitated k median problem"):
  with members:
    - "constant approximation for capacitated k median with 1 epsilon capacity violation"
    - "constant factor approximation algorithms for uniform hard capacitated facility location problems natural lp is not too bad"
    - "an improved approximation algorithm for the hard uniform capacitated k median problem"
    - "on uniform capacitated k median beyond the natural lp relaxation"
    - "approximation algorithms for capacitated facility location problem with penalties"
    - "approximation algorithms for hard capacitated k facility location problems"
    - "bi factor approximation algorithms for hard capacitated k median problems"

Connected through hyperedge HE-6 (induced by source paper "a tight approximation for submodular maximization with mixed packing and covering constraints"):
  with members:
    - "learning determinantal point processes"
    - "symmetry and approximability of submodular maximization problems"
    - "learning with submodular functions a convex optimization perspective"

Connected through hyperedge HE-7 (induced by source paper "constant factor approximation algorithms for uniform hard capacitated facility location problems natural lp is not too bad"):
  with members:
    - "constant approximation for capacitated k median with 1 epsilon capacity violation"
    - "an improved approximation algorithm for the hard uniform capacitated k median problem"
    - "on uniform capacitated k median beyond the natural lp relaxation"
    - "an improved approximation for k median and positive correlation in budgeted optimization"
    - "lp based algorithms for capacitated facility location"
    - "approximation algorithms for hard capacitated k facility location problems"
    - "improved approximation algorithms for matroid and knapsack median problems and applications"
    - "bi factor approximation algorithms for hard capacitated k median problems"

Connected through hyperedge HE-8 (induced by source paper "constant approximation for capacitated k median with 1 epsilon capacity violation"):
  with members:
    - "an improved approximation algorithm for the hard uniform capacitated k median problem"
    - "on uniform capacitated k median beyond the natural lp relaxation"
    - "an improved approximation for k median and positive correlation in budgeted optimization"
    - "lp based algorithms for capacitated facility location"
    - "approximation algorithms for hard capacitated k facility location problems"
    - "bi factor approximation algorithms for hard capacitated k median problems"
    - "approximating k median via pseudo approximation"

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)