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 "approximating multiobjective combinatorial optimization problems with the owa criterion"):
  Abstract: The paper deals with a multiobjective combinatorial optimization problem with $K$ linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate the cost functions and compute a solution. It is well known that minimizing OWA for most basic combinatorial problems is weakly NP-hard even if the number of objectives $K$ equals two, and strongly NP-hard when $K$ is a part of the input. In this paper, the problem with nonincreasing weights in the OWA criterion and a large $K$ is considered. A method of reducing the number of objectives by appropriately aggregating the objective costs before solving the problem is proposed. It is shown that an optimal solution to the reduced problem has a guaranteed worst-case approximation ratio. Some new approximation results for the Hurwicz criterion, which is a special case of OWA, are also presented.

Includes members:
  Member "using the wowa operator in robust discrete optimization problems":
    also connected through other hyperedges:
      (none)
  Member "improved approximation algorithms for the min max selecting items problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust recoverable and two stage selection problems")
  Member "combinatorial optimization problems with uncertain costs and the owa criterion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems")
  Member "exact algorithms for owa optimization in multiobjective spanning tree problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using the wowa operator in robust discrete optimization problems")

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)