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: "on the approximability and exact algorithms for vector domination and related problems in graphs"
  Abstract: We consider two graph optimization problems called vector domination and total vector domination. In vector domination one seeks a small subset S of vertices of a graph such that any vertex outside S has a prescribed number of neighbors in S. In total vector domination, the requirement is extended to all vertices of the graph. We prove that these problems (and several variants thereof) cannot be approximated to within a factor of clnn, where c is a suitable constant and n is the number of the vertices, unless P=NP. We also show that two natural greedy strategies have approximation factors [email protected]+O(1), where @D is the maximum degree of the input graph. We also provide exact polynomial time algorithms for several classes of graphs. Our results extend, improve, and unify several results previously known in the literature.

Connected through hyperedge HE-1 (induced by source paper "new algorithms for weighted k domination and total k domination problems in proper interval graphs"):
  with members:
    - "complexity results for k domination and α domination problems and their variants"
    - "a width parameter useful for chordal and co comparability graphs"
    - "latency bounded target set selection in social networks"
    - "the parameterized complexity of domination type problems and application to linear codes"
    - "total vector domination for graphs with bounded branchwidth"

Connected through hyperedge HE-2 (induced by source paper "complexity results for k domination and α domination problems and their variants"):
  with members:
    - "latency bounded target set selection in social networks"
    - "total vector domination for graphs with bounded branchwidth"
    - "analytical approach to parallel repetition"

Connected through hyperedge HE-3 (induced by source paper "constant approximation algorithms for highly connected multi dominating sets in unit disk graphs"):
  with members:
    - "approximation algorithm for minimum weight fault tolerant virtual backbone in unit disk graphs"
    - "latency bounded target set selection in social networks"
    - "spider covers for prize collecting network activation problem"

Connected through hyperedge HE-4 (induced by source paper "latency bounded target set selection in social networks"):
  with members:
    - "parameterized approximability of maximizing the spread of influence in networks"
    - "influence diffusion in social networks under time window constraints"
    - "contagious sets in expanders"
    - "minimum weight dynamo and fast opinion spreading"
    - "target set selection problem for honeycomb networks"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of the vector connectivity problem"):
  with members:
    - "latency bounded target set selection in social networks"
    - "on kernelization and approximation for the vector connectivity problem"

Connected through hyperedge HE-6 (induced by source paper "total vector domination for graphs with bounded branchwidth"):
  with members:
    - "latency bounded target set selection in social networks"

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.DM(Discrete Mathematics)