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 "approximation algorithms for minimum norm and ordered optimization problems"):
  Abstract: $ $In many optimization problems, a feasible solution induces a multi-dimensional cost vector. For example, in load-balancing a schedule induces a load vector across the machines. In $k$-clustering, opening $k$ facilities induces an assignment cost vector across the clients. In this paper we consider the following minimum norm optimization problem : Given an arbitrary monotone, symmetric norm, find a solution which minimizes the norm of the induced cost-vector. This generalizes many fundamental NP-hard problems. #R##N#We give a general framework to tackle the minimum norm problem, and illustrate its efficacy in the unrelated machine load balancing and $k$-clustering setting. Our concrete results are the following. #R##N#$\bullet$ We give constant factor approximation algorithms for the minimum norm load balancing problem in unrelated machines, and the minimum norm $k$-clustering problem. To our knowledge, our results constitute the first constant-factor approximations for such a general suite of objectives. #R##N#$\bullet$ In load balancing with unrelated machines, we give a $2$-approximation for the problem of finding an assignment minimizing the sum of the largest $\ell$ loads, for any $\ell$. We give a $(2+\varepsilon)$-approximation for the so-called ordered load-balancing problem. #R##N#$\bullet$ For $k$-clustering, we give a $(5+\varepsilon)$-approximation for the ordered $k$-median problem significantly improving the constant factor approximations from Byrka, Sornat, and Spoerhase (STOC 2018) and Chakrabarty and Swamy (ICALP 2018). #R##N#$\bullet$ Our techniques also imply $O(1)$ approximations to the best simultaneous optimization factor for any instance of the unrelated machine load-balancing and the $k$-clustering setting. To our knowledge, these are the first positive simultaneous optimization results in these settings.

Includes members:
  Member "constant factor approximation for ordered k median":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconciliation k median clustering with non polarized representatives")
  Member "approximate near neighbors for general symmetric norms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximate similarity search under edit distance using locality sensitive hashing")
  Member "better guarantees for k means and euclidean k median by primal dual algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fair correlation clustering")
  Member "on the configuration lp of the restricted assignment problem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simpler and better algorithms for minimum norm load balancing")
  Member "streaming symmetric norms via measure concentration":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sketching transformed matrices with applications to natural language processing")
  Member "an improved approximation for k median and positive correlation in budgeted optimization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "individual fairness for k clustering")
  Member "approximating k median via pseudo approximation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fair correlation clustering")
  Member "santa claus schedules jobs on unrelated machines":
    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)