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 "quasi popular matchings optimality and extended formulations"):
  Abstract: Let G = ((A,B),E) be an instance of the stable marriage problem where every vertex ranks its neighbors in a strict order of preference. A matching M in G is popular if M does not lose a head-to-head election against any matching N. That is, \phi(M,N) >= \phi(N,M) where \phi(M,N) (similarly, phi(N,M)) is the number of votes for M (resp., N) in the M-vs-N election. Popular matchings are a well-studied generalization of stable matchings, introduced with the goal of enlarging the set of admissible solutions, while maintaining a certain level of fairness. Stable matchings are, in fact, popular matchings of minimum size. Unfortunately, unlike in the case of stable matchings, it is NP-hard to find a popular matching of minimum cost, when a linear cost function is given on the edge set -- even worse, the min-cost popular matching problem is hard to approximate up to any factor. #R##N#The goal of this paper is to obtain efficient algorithms for computing desirable matchings (wrt cost) by paying the price of mildly relaxing popularity. Call a matching M quasi-popular if \phi(M,N) >= \phi(N,M)/2 for every matching N. Our main positive result is a bi-criteria algorithm that finds in polynomial time a quasi-popular matching of cost at most opt, where opt is the cost of a min-cost popular matching. Key to the algorithm are a number of results for certain polytopes related to matchings and that we believe to be of independent interest. In particular, we give a polynomial-size extended formulation for an integral polytope sandwiched between the popular and quasi-popular matching polytopes. We complement these results by showing that it is NP-hard to find a quasi-popular matching of minimum cost, and that both the popular and quasi-popular matching polytopes have near-exponential extension complexity.

Includes members:
  Member "understanding popular matchings via stable matchings":
    also connected through other hyperedges:
      (none)
  Member "unpopularity factor in the marriage and roommates problems":
    also connected through other hyperedges:
      (none)
  Member "popular matching in roommates setting is np hard":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "understanding popular matchings via stable matchings")
  Member "popular matchings and limits to tractability":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "understanding popular matchings via stable matchings")
  Member "extension complexity of independent set polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "lifting with simple gadgets and applications to circuit and proof complexity")
  Member "popular edges and dominant matchings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "understanding popular matchings via stable matchings")
  Member "the matching polytope has exponential extension complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "extended formulation lower bounds for refuting random csps")

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)