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 "parameterized algorithms for power efficiently connecting sensor networks theory and experiments"):
  Abstract: We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless sensor communication network: Given an edge-weighted $n$-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. On the negative side, we show that $o(\log n)$-approximating the difference $d$ between the optimal solution cost and a natural lower bound is NP-hard and that, under the Exponential Time Hypothesis, there are no exact algorithms running in $2^{o(n)}$ time or in $f(d)\cdot n^{O(1)}$ time for any computable function $f$. On the positive side, we provide an algorithm that reconnects $O(\log n)$ connected components with minimum additional cost in polynomial time. These algorithms are motivated by application scenarios of monitoring areas or where an existing sensor network may fall apart into several connected components due to sensor faults. In experiments, the algorithm solves instances with four such connected components and about 8 000 vertices in five minutes, outperforming CPLEX with known ILP formulations for the problem.

Includes members:
  Member "on approximate data reduction for the rural postman problem theory and experiments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal size problem kernels for d hitting set in linear time and space")
  Member "parameterizing edge modification problems above lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cluster editing parameterized above the size of a modification disjoint p 3 packing is para np hard")
  Member "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized algorithms and data reduction for the short secluded s t path problem")
  Member "parameterized algorithms for power efficient connected symmetric wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polynomial time data reduction for weighted problems beyond additive goal functions")
  Member "minimum power range assignment for symmetric connectivity in sensor networks with two power levels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parameterized algorithms for power efficient connected symmetric wireless sensor networks")
  Member "raising the bar for vertex cover fixed parameter tractability above a higher guarantee":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "elimination distances blocking sets and kernels for vertex cover")
  Member "on multiway cut parameterized above lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structural parameterizations with modulator oblivion")

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)