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: "the traveling salesman problem for lines and rays in the plane"
  Abstract: In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present several linear-time approximation algorithms with improved ratios for these problems for two cases of neighborhoods that are (infinite) lines, and respectively, (half-infinite) rays. Along the way we derive a tight bound on the minimum perimeter of a rectangle enclosing an open curve of length $L$.

Connected through hyperedge HE-1 (induced by source paper "a ptas for euclidean tsp with hyperplane neighborhoods"):
  with members:
    - "chasing convex bodies optimally"
    - "competitively chasing convex bodies"
    - "a ptas for tsp with neighborhoods among fat regions in the plane"
    - "nested convex bodies are chaseable"
    - "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme"
    - "the traveling salesman problem for lines balls and planes"
    - "approximation algorithms for tsp with neighborhoods in the plane"

Connected through hyperedge HE-2 (induced by source paper "the traveling salesman problem for lines balls and planes"):
  with members:
    - "constant factor approximation for tsp with disks"
    - "a ptas for tsp with neighborhoods among fat regions in the plane"
    - "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme"
    - "the stretch factor of the delaunay triangulation is less than 1 998"
    - "the guillotine approach for tsp with neighborhoods revisited"
    - "approximation algorithms for tsp with neighborhoods in the plane"

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)