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: "on the configuration lp for scheduling on unrelated machines"
  Abstract: One of the most important open problems in machine scheduling is the problem of scheduling a set of jobs on unrelated machines to minimize the makespan. The best known approximation algorithm for this problem guarantees an approximation factor of 2. It is known to be NP-hard to approximate with a better ratio than 3/2. Closing this gap has been open for over 20 years. The best known approximation factors are achieved by LP-based algorithms. The strongest known linear program formulation for the problem is the configuration-LP. We show that the configuration-LP has an integrality gap of 2 even for the special case of unrelated graph balancing, where each job can be assigned to at most two machines. In particular, our result implies that a large family of cuts does not help to diminish the integrality gap of the canonical assignment-LP. Also, we present cases of the problem which can be approximated with a better factor than 2. They constitute valuable insights for constructing an NP-hardness reduction which improves the known lower bound. Very recently Svensson studied the restricted assignment case, where each job can only be assigned to a given set of machines on which it has the same processing time. He shows that in this setting the configuration-LP has an integrality gap of 33/17<2. Hence, our result imply that the unrelated graph balancing case is significantly more complex than the restricted assignment case. Then we turn to another objective function: maximizing the minimum machine load. For the case that every job can be assigned to at most two machines we give a purely combinatorial 2-approximation algorithm which is best possible, unless P=NP. This improves on the computationally costly LP-based (2+eps)-approximation algorithm by Chakrabarty et al.

Connected through hyperedge HE-1 (induced by source paper "parameterized orientable deletion"):
  with members:
    - "not so easy problems for tree decomposable graphs"
    - "known algorithms on graphs of bounded treewidth are probably optimal"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-2 (induced by source paper "an improved approximation guarantee for the maximum budgeted allocation problem"):
  with members:
    - "on the configuration lp for maximum budgeted allocation"
    - "approximating bin packing within o log opt log log opt bins"
    - "santa claus schedules jobs on unrelated machines"
    - "combinatorial auctions with decreasing marginal utilities"

Connected through hyperedge HE-3 (induced by source paper "optimization and reoptimization in scheduling problems"):
  with members:
    - "reallocation problems in scheduling"
    - "scheduling meets fixed parameter tractability"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-4 (induced by source paper "a combinatorial approximation algorithm for graph balancing with light hyper edges"):
  with members:
    - "the 2 valued case of makespan minimization with assignment constraints"
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-5 (induced by source paper "the 2 valued case of makespan minimization with assignment constraints"):
  with members:
    - "santa claus schedules jobs on unrelated machines"

Connected through hyperedge HE-6 (induced by source paper "santa claus schedules jobs on unrelated machines"):
  with members:
    - "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.DM(Discrete Mathematics)