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 "lp branching algorithms based on biased graphs"):
  Abstract: We give a combinatorial condition for the existence of efficient, LP-based FPT algorithms for a broad class of graph-theoretical optimisation problems. Our condition is based on the notion of biased graphs known from matroid theory. Specifically, we show that given a biased graph $\Psi=(G,\mathcal{B})$, where $\mathcal{B}$ is a class of balanced cycles in $G$, the problem of finding a set $X$ of at most $k$ vertices in $G$ which intersects every unbalanced cycle in $G$ admits an FPT algorithm using an LP-branching approach, similar to those previously seen for VCSP problems (Wahlstr\"om, SODA 2014). Our algorithm has two parts. First we define a \emph{local problem}, where we are additionally given a root vertex $v_0 \in V$ and asked only to delete vertices $X$ (excluding $v_0$) so that the connected component of $v_0$ in $G-X$ contains no unbalanced cycle. We show that this local problem admits a persistent, half-integral LP-relaxation with a polynomial-time solvable separation oracle, and can therefore be solved in FPT time via LP-branching, assuming only oracle membership queries for the class of balanced cycles in $G$. We then show that solutions to this local problem can be used to tile the graph, producing an optimal solution to the original, global problem as well. This framework captures many of the problems previously solved via the VCSP approach to LP-branching, as well as new generalisations, such as Group Feedback Vertex Set for infinite groups (e.g., for graphs whose edges are labelled by matrices). A major advantage compared to previous work is that it is immediate to check the applicability of the result for a given problem, whereas testing applicability of the VCSP approach for a specific VCSP requires determining the existence of an embedding language with certain algebraically defined properties, which is not known to be decidable in general.

Includes members:
  Member "the complexity landscape of decompositional parameters for ilp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "on problems as hard as cnf sat":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "an approach to parameterized resiliency problems using integer linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized resiliency problems via integer linear programming")
  Member "extension complexity mso logic and treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity")
  Member "parameterized integer quadratic programming variables and coefficients":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exact crossing number parameterized by vertex cover")
  Member "a structural approach to kernels for ilps treewidth and total unimodularity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "half integrality lp branching and fpt algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "designing fpt algorithms for cut problems using randomized contractions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "grundy coloring friends half graphs bicliques")

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)