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 "wireless scheduling with power control"):
  Abstract: We consider the scheduling of arbitrary wireless links in the physical model of interference to minimize the time for satisfying all requests. We study here the combined problem of scheduling and power control, where we seek both an assignment of power settings and a partition of the links so that each set satisfies the signal-to-interference-plus-noise (SINR) constraints. #R##N#We give an algorithm that attains an approximation ratio of $O(\log n \cdot \log\log \Delta)$, where $n$ is the number of links and $\Delta$ is the ratio between the longest and the shortest link length. Under the natural assumption that lengths are represented in binary, this gives the first approximation ratio that is polylogarithmic in the size of the input. The algorithm has the desirable property of using an oblivious power assignment, where the power assigned to a sender depends only on the length of the link. We give evidence that this dependence on $\Delta$ is unavoidable, showing that any reasonably-behaving oblivious power assignment results in a $\Omega(\log\log \Delta)$-approximation. #R##N#These results hold also for the (weighted) capacity problem of finding a maximum (weighted) subset of links that can be scheduled in a single time slot. In addition, we obtain improved approximation for a bidirectional variant of the scheduling problem, give partial answers to questions about the utility of graphs for modeling physical interference, and generalize the setting from the standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore the utility of graph models in capturing wireless interference.

Includes members:
  Member "algorithms for scheduling with power control in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond geometry towards fully realistic wireless models")
  Member "algorithms for scheduling with power control in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond geometry towards fully realistic wireless models")
  Member "wireless capacity with oblivious power in general metrics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "sinr diagrams towards algorithmically usable sinr models of wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "is our model for contention resolution wrong")
  Member "opportunity cost algorithms for combinatorial auctions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)