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 "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.

Includes members:
  Member "on uniform capacitated k median beyond the natural lp relaxation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fair clustering with multiple colors")
  Member "an improved approximation for k median and positive correlation in budgeted optimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "individual fairness for k clustering")
  Member "lp based algorithms for capacitated facility location":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "easy capacitated facility location problems with connections to lot sizing")
  Member "approximating capacitated k median with 1 epsilon k open facilities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "generalized center problems with outliers")
  Member "approximation algorithms for hard capacitated k facility location problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "facility location problem with capacity constraints algorithmic and mechanism design perspectives")
  Member "bi factor approximation algorithms for hard capacitated k median problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reconciliation k median clustering with non polarized representatives")
  Member "approximating k median via pseudo approximation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fair correlation clustering")

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)