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 "combinatorial n fold integer programming and applications"):
  Abstract: Many fundamental NP-hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential only in the dimension of the program, and polynomial in the size of the ILP. That algorithm became a ubiquitous tool in the design of fixed-parameter algorithms for NP-hard problems, where one wishes to isolate the hardness of a problemby some parameter. However, in many cases using Lenstra's algorithm has two drawbacks: First, the run time of the resulting algorithms is often doubly-exponential in the parameter, and second, an ILP formulation in small dimension cannot easily express problems involving many different costs. #R##N#Inspired by the work of Hemmecke, Onn and Romanchuk [Math. Prog. 2013], we develop a single-exponential algorithm for so-called combinatorial n-fold integer programs, which are remarkably similar to prior ILP formulations for various problems, but unlike them, also allow variable dimension. We then apply our algorithm to a few representative problems like Closest String, Swap Bribery, Weighted Set Multicover, and obtain exponential speedups in the dependence on the respective parameters, the input size, or both. #R##N#Unlike Lenstra's algorithm, which is essentially a bounded search tree algorithm, our result uses the technique of augmenting steps. At its heart is a deep result stating that in combinatorial n-fold IPs, existence of an augmenting step implies existence of a \local" augmenting step, which can be found using dynamic programming. Our results provide an important insight into many problems by showing that they exhibit this phenomenon, and highlights the importance of augmentation techniques.

Includes members:
  Member "a parameterized strongly polynomial algorithm for block structured integer programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "n fold integer programming via lp rounding")
  Member "on integer programming and convolution":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "n fold integer programming via lp rounding")
  Member "scheduling meets n fold integer programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "n fold integer programming via lp rounding")
  Member "the complexity landscape of decompositional parameters for ilp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameterized algorithms for milps with small treedepth")
  Member "proximity results and faster algorithms for integer programming using the steinitz lemma":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "n fold integer programming via lp rounding")
  Member "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on adaptive algorithms for maximum matching")
  Member "voting and bribing in single exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "n fold integer programming via lp rounding")
  Member "about the structure of the integer cone and its application to bin packing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multitype integer monoid optimization and applications")

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)