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 "dual fitting approximation algorithms for network connectivity problems"):
  Abstract: We consider the NP-complete network connectivity problem of Dual Power Assignment (DPA). This models an ad hoc networks where each node can either operate at high or low power. The goal is to produce a minimum power strongly connected network. We give a Dual-Fitting algorithm to DPA with a 3/2-approximation ratio, improving the previous best know approximation of $11/7\approx 1.57$. Another standard network design problem is Minimum Strongly Connected Spanning Subgraph (MSCS). We propose a new problem generalizing MSCS and DPA called Star Strong Connectivity (SSC). Then we show that our Dual-Fitting approach achieves a 1.6-approximation ratio to SSC. This Dual-Fitting approach may have applications to other connectivity programs with cut-based linear programming relaxations. As a result of our approximations, we prove new upper bounds on the integrality gaps of these problems. For completeness, we present a family of instances of MSCS (and thus SSC) with integrality gap approaching 4/3.

Includes members:
  Member "dual power assignment via second hamiltonian cycle":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dual based approximation algorithms for cut based network connectivity problems")
  Member "on min power steiner tree":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dual based approximation algorithms for cut based network connectivity problems")
  Member "on strongly connected digraphs with bounded cycle length":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "correspondent banking networks theory and experiment")
  Member "approximating the minimum equivalent digraph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "twinless articulation points and some related problems")

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)