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 "a ptas for the weighted unit disk cover problem"):
  Abstract: We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of disks of minimum total weight that covers all given points. \UDC\ is one of the geometric set cover problems, which have been studied extensively for the past two decades (for many different geometric range spaces, such as (unit) disks, halfspaces, rectangles, triangles). It is known that the unweighted \UDC\ problem is NP-hard and admits a polynomial-time approximation scheme (PTAS). For the weighted \UDC\ problem, several constant approximations have been developed. However, whether the problem admits a PTAS has been an open question. In this paper, we answer this question affirmatively by presenting the first PTAS for \UDC. Our result implies the first PTAS for the minimum weight dominating set problem in unit disk graphs. Combining with existing ideas, our result can also be used to obtain the first PTAS for the maxmimum lifetime coverage problem and an improved constant approximation ratio for the connected dominating set problem in unit disk graphs.

Includes members:
  Member "tighter estimates for epsilon nets for disks":
    also connected through other hyperedges:
      (none)
  Member "qptas for geometric set cover problems via optimal separators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal parameterized algorithms for planar facility location problems using voronoi diagrams")
  Member "epsilon nets for halfspaces revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subsampling in smoothed range spaces")
  Member "analytical approach to parallel repetition":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an improved algorithm for dynamic set cover")
  Member "approximation schemes for maximum weight independent set of rectangles":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "independent sets of dynamic rectangles algorithms and experiments")
  Member "the geometry of scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a water filling primal dual algorithm for approximating non linear covering problems")
  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)