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 "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"):
  Abstract: We study a general family of facility location problems defined on planar graphs and on the 2-dimensional plane. In these problems, a subset of $k$ objects has to be selected, satisfying certain packing (disjointness) and covering constraints. Our main result is showing that, for each of these problems, the $n^{O(k)}$ time brute force algorithm of selecting $k$ objects can be improved to $n^{O(\sqrt{k})}$ time. The algorithm is based on an idea that was introduced recently in the design of geometric QPTASs, but was not yet used for exact algorithms and for planar graphs. We focus on the Voronoi diagram of a hypothetical solution of $k$ objects, guess a balanced separator cycle of this Voronoi diagram to obtain a set that separates the solution in a balanced way, and then recurse on the resulting subproblems. We complement our study by giving evidence that packing problems have $n^{O(\sqrt{k})}$ time algorithms for a much more general class of objects than covering problems have.

Includes members:
  Member "the limited blessing of low dimensionality when 1 1 d is the best possible exponent for d dimensional geometric problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "almost tight lower bounds for hard cutting problems in embedded graphs")
  Member "qptas for geometric set cover problems via optimal separators":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximation algorithms for polynomial expansion and low density graphs")
  Member "quasi polynomial time approximation scheme for sparse subsets of polygons":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient approximation schemes for uniform cost clustering problems in planar graphs")
  Member "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quasi polynomial time approximation schemes for packing and covering problems in planar graphs")
  Member "network sparsification for steiner problems on planar and bounded genus graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a relaxation of the directed disjoint paths problem a global congestion metric helps")
  Member "approximation schemes for maximum weight independent set of rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "kernelization of packing problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the approximate compressibility of connected vertex cover")
  Member "k gap interval graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized domination in circle graphs")

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)