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 "restricted max min allocation approximation and integrality gap"):
  Abstract: Asadpour, Feige, and Saberi proved that the integrality gap of the configuration LP for the restricted max-min allocation problem is at most $4$. However, their proof does not give a polynomial-time approximation algorithm. A lot of efforts have been devoted to designing an efficient algorithm whose approximation ratio can match this upper bound for the integrality gap. In ICALP 2018, we present a $(6 + \delta)$-approximation algorithm where $\delta$ can be any positive constant, and there is still a gap of roughly $2$. In this paper, we narrow the gap significantly by proposing a $(4+\delta)$-approximation algorithm where $\delta$ can be any positive constant. The approximation ratio is with respect to the optimal value of the configuration LP, and the running time is $\mathit{poly}(m,n)\cdot n^{\mathit{poly}(\frac{1}{\delta})}$ where $n$ is the number of players and $m$ is the number of resources. We also improve the upper bound for the integrality gap of the configuration LP to $3 + \frac{21}{26} \approx 3.808$.

Includes members:
  Member "integrality gap of the configuration lp for the restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a tale of santa claus hypergraphs and matroids")
  Member "a tale of santa claus hypergraphs and matroids":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximating nash social welfare under submodular valuations through un matchings")
  Member "restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "inapproximability results for scheduling with interval and resource restrictions")
  Member "combinatorial algorithm for restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximating nash social welfare under submodular valuations through un matchings")
  Member "quasi polynomial local search for restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "local search breaks 1 75 for graph balancing")
  Member "a new approximation technique for resource allocation problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a constant factor approximation for capacitated min max tree cover")
  Member "new constructive aspects of the lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fast sampling and counting k sat solutions in the local lemma regime")
  Member "on allocating goods to maximize fairness":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution")

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)