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 "approximability of covering cells with line segments"):
  Abstract: In COCOA 2015, Korman et al. studied the following geometric covering problem: given a set $S$ of $n$ line segments in the plane, find a minimum number of line segments such that every cell in the arrangement of the line segments is covered. Here, a line segment $s$ covers a cell $f$ if $s$ is incident to $f$. The problem was shown to be NP-hard, even if the line segments in $S$ are axis-parallel, and it remains NP-hard when the goal is cover the "rectangular" cells (i.e., cells that are defined by exactly four axis-parallel line segments). #R##N#In this paper, we consider the approximability of the problem. We first give a PTAS for the problem when the line segments in $S$ are in any orientation, but we can only select the covering line segments from one orientation. Then, we show that when the goal is to cover the rectangular cells using line segments from both horizontal and vertical line segments, then the problem is APX-hard. We also consider the parameterized complexity of the problem and prove that the problem is FPT when parameterized by the size of an optimal solution. Our FPT algorithm works when the line segments in $S$ have two orientations and the goal is to cover all cells, complementing that of Korman et al. in which the goal is to cover the "rectangular" cells.

Includes members:
  Member "approximating dominating set on intersection graphs of rectangles and l frames":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing maximum independent set on outerstring graphs and their relatives")
  Member "line segment covering of cells in arrangements":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "covering and packing of rectilinear subdivision")
  Member "covering segments with unit squares":
    also connected through other hyperedges:
      (none)
  Member "approximation schemes for covering and packing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximum bipartite subgraph of geometric intersection graphs")
  Member "coloring and guarding arrangements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "covering partial cubes with zones")
  Member "approximation algorithms for maximum independent set of pseudo disks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "improved approximation algorithms for geometric set cover":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the epsilon t net problem")

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.CG(Computational Geometry)