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: "empowering the configuration ip new ptas results for scheduling with setups times"
  Abstract: Integer linear programs of configurations, or configuration IPs, are a classical tool in the design of algorithms for scheduling and packing problems, where a set of items has to be placed in multiple target locations. Herein a configuration describes a possible placement on one of the target locations, and the IP is used to chose suitable configurations covering the items. We give an augmented IP formulation, which we call the module configuration IP. It can be described within the framework of $n$-fold integer programming and therefore be solved efficiently using the algorithm by Hemmecke, Onn, and Romanchuk. Furthermore, we investigate how structural properties can be applied to reduce the description of the IP and thereby speed up the resulting algorithms. As an application, we consider scheduling problems with setup times, in which a set of jobs has to be scheduled on a set of identical machines, with the objective of minimizing the makespan. For instance, we investigate the case that jobs can be split and scheduled on multiple machines. However, before a part of a job can be processed an uninterrupted setup depending on the job has to be paid. For both of the variants that jobs can be executed in parallel or not, we obtain an efficient polynomial time approximation scheme (EPTAS) of running time $f(1/\varepsilon)\times \mathrm{poly}(|I|)$ with a single exponential term in $f$ for the first and a double exponential one for the second case. Previously only constant factor approximations of $5/3$ and $4/3 + \varepsilon$ respectively were known. Furthermore, we present an EPTAS for a problem where classes of (non-splittable) jobs are given, and a setup has to be paid for each class of jobs being executed on one machine.

Connected through hyperedge HE-1 (induced by source paper "n fold integer programming via lp rounding"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "near linear time algorithm for n fold ilps via color coding"
    - "on integer programming and convolution"
    - "tight complexity lower bounds for integer linear programming with few constraints"
    - "scheduling meets n fold integer programming"
    - "combinatorial n fold integer programming and applications"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"

Connected through hyperedge HE-2 (induced by source paper "multitype integer monoid optimization and applications"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "near linear time algorithm for n fold ilps via color coding"
    - "on integer programming and convolution"
    - "on the graver basis of block structured integer programming"
    - "scheduling meets n fold integer programming"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"
    - "about the structure of the integer cone and its application to bin packing"

Connected through hyperedge HE-3 (induced by source paper "parameterized algorithms for milps with small treedepth"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "experimental evaluation of parameterized algorithms for graph separation problems half integral relaxations and matroid based kernelization"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "combinatorial n fold integer programming and applications"
    - "0 1 all csps half integral a path packing and linear time fpt algorithms"
    - "solving integer linear programs with a small number of global variables and constraints"
    - "voting and bribing in single exponential time"

Connected through hyperedge HE-4 (induced by source paper "about the complexity of two stage stochastic ips"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "new bounds on augmenting steps of block structured integer programs"
    - "near linear time algorithm for n fold ilps via color coding"
    - "tight complexity lower bounds for integer linear programming with few constraints"
    - "on the graver basis of block structured integer programming"
    - "scheduling meets n fold integer programming"
    - "combinatorial n fold integer programming and applications"

Connected through hyperedge HE-5 (induced by source paper "approximation algorithms for scheduling with class constraints"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "afptas results for common variants of bin packing a new method for handling the small items"

Connected through hyperedge HE-6 (induced by source paper "approximating weighted completion time for order scheduling with setup times"):
  with members:
    - "scheduling on un related machines with setup times"

Connected through hyperedge HE-7 (induced by source paper "approximation schemes for the generalized extensible bin packing problem"):
  with members:
    - "closing the gap for makespan scheduling via sparsification techniques"

Connected through hyperedge HE-8 (induced by source paper "new bounds on augmenting steps of block structured integer programs"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "on integer programming and convolution"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "evaluating and tuning n fold integer programming"
    - "combinatorial n fold integer programming and applications"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"

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