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: "geometric packing under non uniform constraints"
  Abstract: We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity. We provide a general framework and an algorithm for approximating the optimal solution for packing in hypergraphs arising out of such geometric settings. Using this framework we get a flotilla of results on this problem (and also on its dual, where one wants to pick a maximum weight subset of the points when the regions have capacities). For example, for the case of fat triangles of similar size, we show an O(1)-approximation and prove that no \PTAS is possible.

Connected through hyperedge HE-1 (induced by source paper "approximation schemes for independent set and sparse subsets of polygons"):
  with members:
    - "on approximating maximum independent set of rectangles"
    - "optimal parameterized algorithms for planar facility location problems using voronoi diagrams"
    - "shortest path in a polygon using sublinear space"
    - "approximation schemes for partitioning convex decomposition and surface approximation"
    - "a qptas for the base of the number of triangulations of a planar point set"
    - "quasi polynomial time approximation scheme for sparse subsets of polygons"
    - "a qptas for maximum weight independent set of polygons with polylogarithmically many vertices"
    - "approximation schemes for maximum weight independent set of rectangles"

Connected through hyperedge HE-2 (induced by source paper "towards tight bounds for the streaming set cover problem"):
  with members:
    - "tight bounds for single pass streaming complexity of the set cover problem"
    - "approximation algorithms for polynomial expansion and low density graphs"
    - "incidence geometries and the pass complexity of semi streaming set cover"
    - "semi streaming set cover"
    - "analytical approach to parallel repetition"
    - "superlinear lower bounds for multipass graph processing"
    - "improved approximation algorithms for geometric set cover"

Connected through hyperedge HE-3 (induced by source paper "quasi polynomial time approximation scheme for sparse subsets of polygons"):
  with members:
    - "qptas for geometric set cover problems via optimal separators"
    - "approximation schemes for maximum weight independent set of rectangles"
    - "approximation algorithms for maximum independent set of pseudo disks"
    - "a simple proof of the existence of a planar separator"
    - "being fat and friendly is not enough"

Connected through hyperedge HE-4 (induced by source paper "submodular function maximization via the multilinear relaxation and contention resolution schemes"):
  with members:
    - "symmetry and approximability of submodular maximization problems"
    - "maximizing non monotone submodular set functions subject to different constraints combined algorithms"
    - "mechanism design via correlation gap"
    - "robust and maxmin optimization under matroid and knapsack uncertainty sets"
    - "a note on concentration of submodular functions"
    - "submodular maximization by simulated annealing"
    - "thresholded covering algorithms for robust and max min optimization"
    - "correlation robust stochastic optimization"

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)