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 "discretized approaches to schematization"):
  Abstract: To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by functional need and resemblance. Moreover, stylistic geometry is often used to convey the schematic nature of the map. In this paper we explore discretized approaches to computing a schematic shape $S$ for a simple polygon $P$. We do so by overlaying a plane graph $G$ on $P$ as the solution space for the schematic shape. Topological constraints imply that $S$ should describe a simple polygon. We investigate two approaches, simple map matching and connected face selection, based on commonly used similarity metrics. #R##N#With the former, $S$ is a simple cycle $C$ in $G$ and we quantify resemblance via the Fr\'echet distance. We prove that it is NP-hard to compute a cycle that approximates the minimal Fr\'echet distance over all simple cycles in a plane graph $G$. This result holds even if $G$ is a partial grid graph, if area preservation is required and if we assume a given sequence of turns is specified. #R##N#With the latter, $S$ is a connected face set in $G$, quantifying resemblance via the symmetric difference. Though the symmetric difference seems a less strict measure, we prove that it is NP-hard to compute the optimal face set. This result holds even if $G$ is full grid graph or a triangular or hexagonal tiling, and if area preservation is required. Moreover, it is independent of whether we allow the set of faces to have holes or not.

Includes members:
  Member "solving the maximum weight connected subgraph problem to optimality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the balanced connected subgraph problem")
  Member "intermittent map matching with the discrete frechet distance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "walking the dog fast in practice algorithm engineering of the fr echet distance")
  Member "simple curve embedding":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sampling based bottleneck pathfinding with applications to frechet matching")
  Member "map matching with simplicity constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sampling based bottleneck pathfinding with applications to frechet matching")
  Member "locally correct frechet matchings":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "four soviets walk the dog improved bounds for computing the frechet distance")

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)