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 "online maximum matching with recourse"):
  Abstract: We study the online maximum matching problem with recourse in a model in which the edges are associated with a known recourse parameter $k$. An online algorithm for this problem has to maintain a valid matching while edges of the underlying graph are presented one after the other. At any moment the algorithm can decide to include an edge into the matching or to exclude it, under the restriction that at most $k$ actions per edge take place, where $k$ is typically a small constant. This problem was introduced and studied in the context of general online packing problems with recourse by [Avitabile, Mathieu, Parkinson, 2013], whereas the special case $k=2$ has been studied by [Boyar et al., 2017]. #R##N#In the first part of this paper, we consider the edge arrival model, in which an arriving edge never disappears from the graph. Here, we first show an improved analysis on the performance of the algorithm given in [AMP, 2013], by exploiting the structure of the specific problem. In addition, we extend the result of [Boyar et al., 2017] and show that the greedy algorithm has ratio $3/2$ for every even positive $k$ and ratio $2$ for every odd $k$. Moreover, we present and analyze $L$-Greedy --- an improvement of the greedy algorithm --- which for small values of $k$ outperforms the algorithm of [AMP, 2013]. In terms of lower bounds, we show that no deterministic algorithm better than $1+1/(k-1)$ exists, improving upon the lower bound of $1+1/k$ shown in [AMP, 2013]. #R##N#The second part of the paper is devoted to the edge arrival/departure model, which is the fully dynamic variant of the online matching problem with recourse. The analysis of $L$-Greedy carries through in this model; moreover we show a general lower bound of $(k^2-3k+3)/(k^2-4k+5)$ for all even $k \ge 4$ and provide the stronger bound of $10/7$ for $k=4$. For $k\in\{2,3\}$, the competitive ratio is $3/2$.

Includes members:
  Member "relaxing the irrevocability requirement for online graph algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "online graph matching problems with a worst case reassignment budget")
  Member "online bipartite matching with amortized o log 2 n replacements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")
  Member "online steiner tree with deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maintaining perfect matchings at low cost")
  Member "the power of deferral maintaining a constant competitive steiner tree online":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "scattering and sparse partitions and their applications")
  Member "improved bounds for online preemptive matching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "prophet inequality for bipartite matching merits of being simple and non adaptive")
  Member "buyback problem approximate matroid intersection with cancellation costs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "online stochastic matching with edge arrivals")

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)