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 asymmetric traveling salesman problem on graphs with bounded genus"
  Abstract: We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the Held-Karp linear programming relaxation has bounded orientable genus.

Connected through hyperedge HE-1 (induced by source paper "a method to compute the sparse graphs for traveling salesman problem based on frequency quadrilaterals"):
  with members:
    - "the traveling salesman problem low dimensionality implies a polynomial time approximation scheme"
    - "edge elimination in tsp instances"

Connected through hyperedge HE-2 (induced by source paper "a constant factor approximation algorithm for the asymmetric traveling salesman problem"):
  with members:
    - "the asymmetric traveling salesman path lp has constant integrality ratio"
    - "constant factor approximation for atsp with two edge weights"
    - "approximating atsp by relaxing connectivity"
    - "effective resistance reducing flows spectrally thin trees and asymmetric tsp"
    - "new inapproximability bounds for tsp"
    - "shorter tours by nicer ears 7 5 approximation for graphic tsp 3 2 for the path version and 4 3 for two edge connected subgraphs"
    - "improving christofides algorithm for the s t path tsp"
    - "13 9 approximation for graphic tsp"

Connected through hyperedge HE-3 (induced by source paper "constant factor approximations for asymmetric tsp on nearly embeddable graphs"):
  with members:
    - "kernelization of packing problems"

Connected through hyperedge HE-4 (induced by source paper "approximating atsp by relaxing connectivity"):
  with members:
    - "effective resistance reducing flows spectrally thin trees and asymmetric tsp"
    - "the kadison singer problem for strongly rayleigh measures and applications to asymmetric tsp"
    - "new inapproximability bounds for tsp"
    - "approximating graphic tsp by matchings"
    - "13 9 approximation for graphic tsp"

Connected through hyperedge HE-5 (induced by source paper "constant factor approximation for atsp with two edge weights"):
  with members:
    - "approximating atsp by relaxing connectivity"
    - "new inapproximability bounds for tsp"
    - "approximating graphic tsp by matchings"
    - "13 9 approximation for graphic tsp"

Connected through hyperedge HE-6 (induced by source paper "effective resistance reducing flows spectrally thin trees and asymmetric tsp"):
  with members:
    - "approximating atsp by relaxing connectivity"
    - "the kadison singer problem for strongly rayleigh measures and applications to asymmetric tsp"
    - "a near optimal approximation algorithm for asymmetric tsp on embedded graphs"
    - "pipage rounding pessimistic estimators and matrix concentration"
    - "a randomized rounding algorithm for the asymmetric traveling salesman problem"
    - "twice ramanujan sparsifiers"
    - "graph sparsification by effective resistances"
    - "nearly linear time algorithms for graph partitioning graph sparsification and solving linear systems"

Connected through hyperedge HE-7 (induced by source paper "pipage rounding pessimistic estimators and matrix concentration"):
  with members:
    - "from joint convexity of quantum relative entropy to a concavity theorem of lieb"
    - "near optimal column based matrix reconstruction"
    - "randomized algorithms for matrices and data"
    - "efficient volume sampling for row column subset selection"
    - "dependent randomized rounding for matroid polytopes and applications"
    - "a simpler approach to matrix completion"
    - "twice ramanujan sparsifiers"
    - "an improved approximation algorithm for the column subset selection problem"

Connected through hyperedge HE-8 (induced by source paper "approximation algorithms for euler genus and related problems"):
  with members:
    - "a near optimal approximation algorithm for asymmetric tsp on embedded graphs"
    - "grid minors in damaged grids"
    - "on graph crossing number and edge planarization"
    - "an algorithm for the graph crossing number problem"

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.DS(Data Structures and Algorithms)