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 "the traveling salesman problem for lines balls and planes"):
  Abstract: We revisit the traveling salesman problem with neighborhoods (TSPN) and propose several new approximation algorithms. These constitute either first approximations (for hyperplanes, lines, and balls in $\mathbb{R}^d$, for $d\geq 3$) or improvements over previous approximations achievable in comparable times (for unit disks in the plane). #R##N#\smallskip (I) Given a set of $n$ hyperplanes in $\mathbb{R}^d$, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in $O(n)$ time, when $d$ is constant. #R##N#\smallskip (II) Given a set of $n$ lines in $\mathbb{R}^d$, a TSP tour whose length is at most $O(\log^3 n)$ times the optimal can be computed in polynomial time for all $d$. #R##N#\smallskip (III) Given a set of $n$ unit balls in $\mathbb{R}^d$, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in polynomial time, when $d$ is constant.

Includes members:
  Member "constant factor approximation for tsp with disks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved bounds for the traveling salesman problem with neighborhoods on uniform disks")
  Member "a ptas for tsp with neighborhoods among fat regions in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a ptas for euclidean tsp with hyperplane neighborhoods")
  Member "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a quasi polynomial algorithm for well spaced hyperbolic tsp")
  Member "the stretch factor of the delaunay triangulation is less than 1 998":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drawing graphs as spanners")
  Member "the guillotine approach for tsp with neighborhoods revisited":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constant factor approximation for tsp with disks")
  Member "the traveling salesman problem for lines and rays in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a ptas for euclidean tsp with hyperplane neighborhoods")
  Member "approximation algorithms for tsp with neighborhoods in the plane":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptive view planning for aerial 3d reconstruction")

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)