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 "half integrality lp branching and fpt algorithms"):
  Abstract: A recent trend in parameterized algorithms is the application of polytope tools (specifically, LP-branching) to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012). However, although interesting results have been achieved, the methods require the underlying polytope to have very restrictive properties (half-integrality and persistence), which are known only for few problems (essentially Vertex Cover (Nemhauser and Trotter, 1975) and Node Multiway Cut (Garg et al., 1994)). Taking a slightly different approach, we view half-integrality as a \emph{discrete} relaxation of a problem, e.g., a relaxation of the search space from $\{0,1\}^V$ to $\{0,1/2,1\}^V$ such that the new problem admits a polynomial-time exact solution. Using tools from CSP (in particular Thapper and \v{Z}ivn\'y, 2012) to study the existence of such relaxations, we provide a much broader class of half-integral polytopes with the required properties, unifying and extending previously known cases. #R##N#In addition to the insight into problems with half-integral relaxations, our results yield a range of new and improved FPT algorithms, including an $O^*(|\Sigma|^{2k})$-time algorithm for node-deletion Unique Label Cover with label set $\Sigma$ and an $O^*(4^k)$-time algorithm for Group Feedback Vertex Set, including the setting where the group is only given by oracle access. All these significantly improve on previous results. The latter result also implies the first single-exponential time FPT algorithm for Subset Feedback Vertex Set, answering an open question of Cygan et al. (2012). #R##N#Additionally, we propose a network flow-based approach to solve some cases of the relaxation problem. This gives the first linear-time FPT algorithm to edge-deletion Unique Label Cover.

Includes members:
  Member "towards minimizing k submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "beyond boolean surjective vcsps")
  Member "linear time parameterized algorithms via skew symmetric multicuts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "0 1 all csps half integral a path packing and linear time fpt algorithms")
  Member "linear time fpt algorithms via network flow":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph profiling for vertex cover targeted reductions in a branch and reduce solver")
  Member "the power of linear programming for valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "piecewise linear valued csps solvable by linear programming relaxation")
  Member "designing fpt algorithms for cut problems using randomized contractions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "grundy coloring friends half graphs bicliques")
  Member "faster parameterized algorithms using linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "structural parameterizations with modulator oblivion")
  Member "the power of linear programming for valued csps a constructive characterization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of finite valued csps")
  Member "min csp on four elements moving beyond submodularity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "piecewise linear valued csps solvable by linear programming relaxation")

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