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: "quasi polynomial local search for restricted max min fair allocation"
  Abstract: The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. proved that a certain configuration LP can be used to estimate the optimal value within a factor ${1}/{(4+\epsilon)}$, for any $\epsilon>0$, but at the same time it is not known how to efficiently find a solution with a comparable performance guarantee. #R##N#A natural question that arises from their work is if the difference between these guarantees is inherent or because of a lack of suitable techniques. We address this problem by giving a quasi-polynomial approximation algorithm with the mentioned performance guarantee. More specifically, we modify the local search of Asadpour et al. and provide a novel analysis that lets us significantly improve the bound on its running time: from $2^{O(n)}$ to $n^{O(\log n)}$. Our techniques also have the interesting property that although we use the rather complex configuration LP in the analysis, we never actually solve it and therefore the resulting algorithm is purely combinatorial.

Connected through hyperedge HE-1 (induced by source paper "restricted max min allocation approximation and integrality gap"):
  with members:
    - "integrality gap of the configuration lp for the restricted max min fair allocation"
    - "a tale of santa claus hypergraphs and matroids"
    - "restricted max min fair allocation"
    - "combinatorial algorithm for restricted max min fair allocation"
    - "a new approximation technique for resource allocation problems"
    - "new constructive aspects of the lovasz local lemma"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-2 (induced by source paper "local search breaks 1 75 for graph balancing"):
  with members:
    - "a quasi polynomial approximation for the restricted assignment problem"
    - "lazy local search meets machine scheduling"
    - "a combinatorial approximation algorithm for graph balancing with light hyper edges"
    - "santa claus schedules jobs on unrelated machines"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-3 (induced by source paper "a quasi polynomial approximation for the restricted assignment problem"):
  with members:
    - "on the configuration lp of the restricted assignment problem"
    - "lazy local search meets machine scheduling"
    - "on 1 epsilon restricted assignment makespan minimization"
    - "combinatorial algorithm for restricted max min fair allocation"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-4 (induced by source paper "the heterogeneous capacitated k center problem"):
  with members:
    - "the non uniform k center problem"
    - "constant approximation for capacitated k median with 1 epsilon capacity violation"
    - "on uniform capacitated k median beyond the natural lp relaxation"
    - "lp based algorithms for capacitated facility location"
    - "approximating capacitated k median with 1 epsilon k open facilities"
    - "lp rounding for k centers with non uniform hard capacities"
    - "approximability of capacitated network design"
    - "a new approximation technique for resource allocation problems"

Connected through hyperedge HE-5 (induced by source paper "on 1 epsilon restricted max min fair allocation problem"):
  with members:
    - "on 1 epsilon restricted assignment makespan minimization"
    - "combinatorial algorithm for restricted max min fair allocation"
    - "santa claus schedules jobs on unrelated machines"
    - "new constructive aspects of the lovasz local lemma"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-6 (induced by source paper "on the configuration lp of the restricted assignment problem"):
  with members:
    - "a combinatorial approximation algorithm for graph balancing with light hyper edges"
    - "combinatorial algorithm for restricted max min fair allocation"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-7 (induced by source paper "finding perfect matchings in bipartite hypergraphs"):
  with members:
    - "combinatorial algorithm for restricted max min fair allocation"
    - "improved approximation for 3 dimensional matching via bounded pathwidth local search"
    - "large neighborhood local search for the maximum set packing problem"
    - "navigating central path with electrical flows from flows to matchings and back"
    - "santa claus schedules jobs on unrelated machines"
    - "new constructive aspects of the lovasz local lemma"

Connected through hyperedge HE-8 (induced by source paper "combinatorial algorithm for restricted max min fair allocation"):
  with members:
    - "finding perfect matchings in bipartite hypergraphs"
    - "a new approximation technique for resource allocation problems"
    - "santa claus schedules jobs on unrelated machines"
    - "new constructive aspects of the lovasz local lemma"
    - "on allocating goods to maximize fairness"

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)