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: "complexity and inapproximability results for parallel task scheduling and strip packing"
  Abstract: We study the Parallel Task Scheduling problem $Pm|size_j|C_{\max}$ with a constant number of machines. This problem is known to be strongly NP-complete for each $m \geq 5$, while it is solvable in pseudo-polynomial time for each $m \leq 3$. We give a positive answer to the long-standing open question whether this problem is strongly $NP$-complete for $m=4$. As a second result, we improve the lower bound of $\frac{12}{11}$ for approximating pseudo-polynomial Strip Packing to $\frac{5}{4}$. Since the best known approximation algorithm for this problem has a ratio of $\frac{4}{3} + \varepsilon$, this result narrows the gap between approximation ratio and inapproximability result by a significant step. Both results are proven by a reduction from the strongly $NP$-complete problem 3-Partition.

Connected through hyperedge HE-1 (induced by source paper "improved pseudo polynomial time approximation for strip packing"):
  with members:
    - "approximating geometric knapsack via l packings"
    - "closing the gap for pseudo polynomial strip packing"
    - "improved approximation for two dimensional strip packing with polynomial bounded width"
    - "approximation schemes for maximum weight independent set of rectangles"

Connected through hyperedge HE-2 (induced by source paper "closing the gap for pseudo polynomial strip packing"):
  with members:
    - "improved pseudo polynomial time approximation for strip packing"
    - "scheduling monotone moldable jobs in linear time"
    - "hardness of approximation for strip packing"
    - "improved approximation for two dimensional strip packing with polynomial bounded width"
    - "power strip packing of malleable demands in smart grid"

Connected through hyperedge HE-3 (induced by source paper "improved approximation for two dimensional strip packing with polynomial bounded width"):
  with members:
    - "improved pseudo polynomial time approximation for strip packing"
    - "closing the gap for pseudo polynomial strip packing"
    - "hardness of approximation for strip packing"

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.CC(Computational Complexity)