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 "link scheduling for throughput maximization in multihop wireless networks under physical interference"):
  Abstract: We consider the problem of link scheduling for throughput maximization in multihop wireless networks. Majority of previous methods are restricted to graph-based interference models. In this paper we study the link scheduling problem using a more realistic physical interference model. Through some key observations about this model, we develop efficient link scheduling algorithms by exploiting the intrinsic connections between the physical interference model and the graph-based interference model. For one variant of the problem where each node can dynamically adjust its transmission power, we design a scheduling method with O(g(E)) approximation to the optimal throughput capacity where g(E) denotes length diversity. For the other variant where each node has a fixed but possible different transmission powers for different nodes, we design a method with O(g(E))-approximation ratio when the transmission powers of all nodes are within a constant factor of each other, and in general with an approximation ratio of O(g(E)log\rho) where log\rho is power diversity. #R##N#We further prove that our algorithm for fixed transmission power case retains O(g(E)) approximation for any length-monotone, sub-linear fixed power setting. Furthermore, all these approximation factors are independent of network size.

Includes members:
  Member "mlls minimum length link scheduling under physical interference model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond geometry towards fully realistic wireless models")
  Member "the power of non uniform wireless power":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "data dissemination in unified dynamic wireless networks")
  Member "a fully distributed algorithm for throughput performance in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless link capacity under shadowing and fading")
  Member "wireless network stability in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the power of non uniform wireless power")
  Member "wireless capacity and admission control in cognitive radio":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless capacity with oblivious power in general metrics":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "a constant factor approximation for wireless capacity maximization with power control in the sinr model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "wireless scheduling with power control":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "effective wireless scheduling via hypergraph sketches")

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)