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 "combinatorial algorithm for restricted max min fair allocation"):
  Abstract: We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain configuration-LP can be used to estimate the value of the optimal allocation to within a factor of $4 + {\epsilon}$. In contrast, however, the best known approximation algorithm for the problem has an unspecified large constant guarantee. #R##N#In this paper we significantly narrow this gap by giving a $13$-approximation algorithm for the problem. Our approach develops a local search technique introduced by Haxell [Hax95] for hypergraph matchings, and later used in this context by Asadpour, Feige, and Saberi [AFS12]. For our local search procedure to terminate in polynomial time, we introduce several new ideas such as lazy updates and greedy players. Besides the improved approximation guarantee, the highlight of our approach is that it is purely combinatorial and uses the configuration-LP only in the analysis.

Includes members:
  Member "finding perfect matchings in bipartite hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hierarchical decomposition mechanism by konig egervary layer subgraph with application on vertex cover")
  Member "quasi polynomial local search for restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "restricted max min allocation approximation and integrality gap")
  Member "a new approximation technique for resource allocation problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "restricted max min allocation approximation and integrality gap")
  Member "santa claus schedules jobs on unrelated machines":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution")
  Member "new constructive aspects of the lovasz local lemma":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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)