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 "buffer management of multi queue qos switches with class segregation"):
  Abstract: We focus on buffer management of multi-queue QoS switches with class segregation.Our model consists of m queues and m packet values 0 < v 1 < v 2 < ? < v m .We analyze the competitive ratio of Greedy for general case.We show that the competitive ratio of Greedy is ( 1 + r ) , where r = max i ? v i / v i + 1 . In this paper, we focus on buffer management of multi-queue QoS switches in which packets of different values are segregated in different queues. Our model consists of m queues and m packet values 0 < v 1 < v 2 < ? < v m . Recently, Al-Bawani and Souza (2013) 2] presented an online algorithm greedy for buffer management of multi-queue QoS switches with class segregation and showed that if m queues have the same size, then greedy is ( 1 + r ) -competitive, where r = max 1 ? i ? m - 1 ? v i v i + 1 . In this paper, we show that greedy is ( 1 + r ) -competitive for the case that m queues do not necessarily have the same size.

Includes members:
  Member "buffer overflow management with class segregation":
    also connected through other hyperedges:
      (none)
  Member "an optimal lower bound for buffer management in multi queue switches":
    also connected through other hyperedges:
      (none)

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.DS(Data Structures and Algorithms)