human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "parameterized algorithms for power efficient connected symmetric wireless sensor networks"
  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. We provide an algorithm that works in polynomial time if one can find a set of obligatory edges that yield a spanning subgraph with $O(\log n)$ connected components. We also provide a linear-time algorithm that reduces any input graph that consists of a tree together with $g$ additional edges to an equivalent graph with $O(g)$ vertices. Based on this, we obtain a polynomial-time algorithm for $g\in O(\log n)$. 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 there are presumably no exact algorithms running in $2^{o(n)}$ time or in $f(d)\cdot n^{O(1)}$ time for any computable function $f$.

Connected through hyperedge HE-1 (induced by source paper "polynomial time data reduction for weighted problems beyond additive goal functions"):
  with members:
    - "parameterized algorithms and data reduction for the short secluded s t path problem"
    - "fixed parameter algorithms for maximum profit facility location under matroid constraints"
    - "on approximate data reduction for the rural postman problem theory and experiments"
    - "fair knapsack"
    - "parameterized power vertex cover"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "new algorithms for minimizing the weighted number of tardy jobs on a single machine"
    - "interval scheduling and colorful independent sets"

Connected through hyperedge HE-2 (induced by source paper "parameterized algorithms for power efficiently connecting sensor networks theory and experiments"):
  with members:
    - "on approximate data reduction for the rural postman problem theory and experiments"
    - "parameterizing edge modification problems above lower bounds"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "minimum power range assignment for symmetric connectivity in sensor networks with two power levels"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "on multiway cut parameterized above lower bounds"

Question: Please tell me which class the center node 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)