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 "joint optimization of scheduling and power control in wireless networks multi dimensional modeling and decomposition"):
  Abstract: The energy efficiency of future networks is becoming a significant and urgent issue, calling for greener network designs. At the same time, rapid development of wireless networks shows a trend of increasing complexity in network structure and resource space, leading to that optimizing the energy efficiency of such networks requires a joint solution over multi-dimensional resource space. However, the coupled resource dimensions and growing problem scales bring great challenges in obtaining the optimal solutions. In this paper, we develop a multi-dimensional network model on the basis of tuple-links associated with transmission patterns (TPs) and formulate the optimization problem as a TP based scheduling problem which jointly solves transmission scheduling, routing, power control, radio and channel assignment. In order to tackle the complexity issues raised from coupled resource dimensions, we propose a novel algorithm that decomposes the coupling scheduling and power control by exploiting the delay column generation technique to recursively solve a master problem for scheduling and a sub-problem for power allocation. Further, we theoretically prove that the performance gap between the proposed algorithm and the optimum is upper bounded by that for the sub-problem solution, where the latter is derived by solving a relaxed version of the sub-problem. Numerical results demonstrate the effectiveness of the multi-dimensional framework and the benefit of the proposed joint optimization in improving network energy efficiency.

Includes members:
  Member "joint scheduling and transmission power control in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "network utility maximization based on incentive mechanism for truthful reporting of local information")
  Member "distributed interference aware energy efficient resource allocation for device to device communications underlaying cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "energy efficiency and spectral efficiency tradeoff in device to device d2d communications")
  Member "on optimizing energy efficiency in multi radio multi channel wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed energy efficient channel allocation")

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.NI(Networking and Internet Architecture)