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: "approximation algorithms for dominating set in disk graphs"
  Abstract: AbstractWe consider the problem of ﬁnding a lowest cost dominating set in a given disk graph containingn disks. The problem has been extensively studied on subclasses of disk graphs, yet the best knownapproximation for disk graphs has remained O(logn) – a bound that is asymptotically no better thanthe general case. We improve the status quo in two ways: for the unweighted case, we show how toobtain a PTAS using the framework recently proposed (independently) by Mustafa and Ray [16] and byChan and Har-Peled [4]; for the weighted case where each input disk has an associated rational weightwith the objective of ﬁnding a minimum cost dominating set, we give a randomized algorithm thatobtains a dominating set whose weight is within a factor 2 O(log ∗ n) of a minimum cost solution, with highprobability – the technique follows the framework proposed recently by Varadarajan [19]. 1 Introduction For a set D of n disks in the Euclidean plane, deﬁne an intersection graph, G = (V,E), thus: V = D;{u,v} ∈ E ⇔ disk(u)∩disk(v) 6= ∅. G is called a

Connected through hyperedge HE-1 (induced by source paper "simple ptas s for families of graphs excluding a minor"):
  with members:
    - "the unreasonable success of local search geometric optimization"
    - "approximation algorithms for maximum independent set of pseudo disks"
    - "single source shortest paths in h minor free graphs"

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